LP-based heuristics for the Traveling Salesman Problem
作者： Matteo Fortini
DOI: 10.6092/UNIBO/AMSDOTTORATO/339
关键词: Mathematical optimization 、 Heuristics 、 Computer science 、 Travelling salesman problem
摘要:
sci-hub.st 参考文章(125)
Manfred W. Padberg, Saman Hong, On the symmetric travelling salesman problem: A computational study Mathematical Programming Studies. pp. 78- 107 ,(1980) , 10.1007/BFB0120888
Sunil Chopra, Giovanni Rinaldi, The Graphical Asymmetric Traveling Salesman Polyhedron integer programming and combinatorial optimization. pp. 129- 145 ,(1990)
Jean-Maurice Clochard, Denis Naddef, Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. integer programming and combinatorial optimization. pp. 291- 311 ,(1993)
Manfred W. Padberg, Covering, Packing and Knapsack Problems Annals of discrete mathematics. ,vol. 4, pp. 265- 287 ,(1979) , 10.1016/S0167-5060(08)70831-8
Martin Grötschel, On the symmetric travelling salesman problem: Solution of a 120-city problem Mathematical Programming Studies. pp. 61- 77 ,(1980) , 10.1007/BFB0120887
Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis, A faster exact separation algorithm for blossom inequalities integer programming and combinatorial optimization. pp. 196- 205 ,(2004) , 10.1007/978-3-540-25960-2_15
Giovanni Rinaldi, D. Naddef, The symmetric traveling salesman polytope: new facets from the graphical relaxation Research Report Series of IASI-CNR, Rome, Italy (ISSN: 1128-3378). ,vol. 609, ,(2004)
Matteo Fischetti, Andrea Lodi, Paolo Toth, Exact Methods for the Asymmetric Traveling Salesman Problem Combinatorial Optimization. pp. 169- 205 ,(2007) , 10.1007/0-306-48213-4_4
Denis Naddef, The Domino Inequalities for the Symmetric Traveling Salesman Problem. The Sharpest Cut. pp. 153- 172 ,(2004)
Toshihide Ibaraki, Tateaki Ohashi, Hisashi Mine, A heuristic algorithm for mixed-integer programming problems Approaches to Integer Programming. pp. 115- 136 ,(1974) , 10.1007/BFB0120691