References
- ApplegateDLBixbyREChvátalVCookWJImplementing the Dantzig–Fulkerson–Johnson algorithm for large scale traveling salesman problemsMath Program Ser B20039791153
- ApplegateDLBixbyREChvátalVCookWJThe Traveling Salesman Problem: A Computational Study2006
- ApplegateDLBixbyREChvátalVCookWJEspinozaDGGoycooleaMHelsgaunKCertification of an optimal TSP tour through 85900 citiesOpns Res Lett200937111510.1016/j.orl.2008.09.006
- BabinGDeneaultSLaporteGImprovements to the Or-opt heuristic for the symmetric travelling salesman problemJ Opl Res Soc20075840240710.1057/palgrave.jors.2602160
- BalasETothPBranch and bound methodsThe Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization1985361401
- BurkardRDell'AmicoMMartelloSAssignment Problems2009
- CarpanetoGTothPSome new branching and bounding criteria for the asymmetric traveling salesman problemMngt Sci19802673674310.1287/mnsc.26.7.736
- CarpanetoGTothPPrimal-dual algorithms for the assignment problemDiscrete Appl Math19871813715310.1016/0166-218X(87)90016-3
- CarpanetoGDell'AmicoMTothPExact solution of large-scale, asymmetric travelling salesman problemsACM Trans Math Software19952139440910.1145/212066.212081
- ChvátalVEdmonds polytopes and weakly Hamiltonian graphsMath Program19735294010.1007/BF01580109
- CornuéjolsGFonluptJNaddefDThe travelling salesman problem on a graph and some related integer polyhedraMath Program19853312710.1007/BF01582008
- CroesGAA method for solving large scale symmetric traveling salesman problemsOpns Res1958679181210.1287/opre.6.6.791
- CrowderHPadbergMWSolving large-scale symmetric traveling salesman problems to optimalityMngt Sci19802649550910.1287/mnsc.26.5.495
- DaganzoCFThe length of tours in zones of different shapesTransport Res B19841813514510.1016/0191-2615(84)90027-4
- DantzigGBFulkersonDRJohnsonSMSolution of a large-scale traveling-salesman problemOpns Res19542393410
- Dell'AmicoMTothPAlgorithms and codes for dense assignment problems: The state of the artDiscrete Appl Math2000100174810.1016/S0166-218X(99)00172-9
- Eastman WL (1958). Linear programming with pattern constraints. PhD thesis, Department of Economics, Harvard University, Cambridge, MA.
- EdmondsJMaximum matching and a polyhedron with 0,1-verticesJ Res Natl Bur Stan196569B12513010.6028/jres.069B.013
- FischettiMTothPAn additive bounding procedure for the asymmetric traveling salesman problemMath Program Ser A19925317319710.1007/BF01585701
- FischettiMLodiATothPExact methods for the asymmetric traveling salesman problemThe Traveling Salesman Problem and Its Variations2002169205
- FloodMMThe traveling-salesman problemOpns Res19564617510.1287/opre.4.1.61
- GabouneBLaporteGSoumisFOptimal strip sequencing strategies for flexible manufacturing operations in two and three dimensionsInt J Flex Manuf Sys1994612313510.1007/BF01328808
- GoldenBLStewartWREmpirical analysis of heuristicsThe Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization1985207249
- GomoryREAn algorithm for integer solutions to linear programsRecent Advances in Mathematical Programming1963269302
- GrötschelMHollandOSolution of large-scale symmetric traveling salesman problemsMath Program19915114120210.1007/BF01586932
- GrötschelMPadbergMWPolyhedral theoryThe Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization1985251305
- GrötschelMPulleyblankWRClique tree inequalities and the symmetric Travelling Salesman ProblemMath Opns Res19861153756910.1287/moor.11.4.537
- GutinGPunnenAPThe Traveling Salesman Problem and Its Variations2002
- HeldMKarpRMThe traveling-salesman problem and minimum spanning trees: Part IIMath Program1971162510.1007/BF01584070
- HelsgaunKAn effective implementation of the Lin–Kernighan traveling salesman heuristicEur J Opl Res200012610613010.1016/S0377-2217(99)00284-2
- JohnsonDSGutinGMcGeochLAYeoAZhangWZverovitchAExperimental analysis of heuristics for the ATSPThe Traveling Salesman Problem and Its Variations2002445487
- JohnsonDSMcGeochLAThe traveling salesman problem: A case studyLocal Search in Combinatorial Optimization1997215310
- JohnsonDSMcGeochLAExperimental analysis of heuristics for the STPSThe Traveling Salesman Problem and Its Variations2002369443
- JüngerMReineltGRinaldiGThe traveling salesman problemNetwork Models Handbooks in Operations Research and Management Science1995225330
- KarpRMA patching algorithm for the nonsymmetric traveling-salesman problemSIAM J Comput1979856157310.1137/0208045
- KarpRMSteeleJMProbabilistic analysis of heuristicsThe Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization1985181205
- Land AH (1979). The solution of some 100-city traveling salesman problems. Technical report, London School of Economics, London.
- LandAHDoigAGAn automatic method of solving discrete programming problemsEconometrica19602849752010.2307/1910129
- LaporteGThe traveling salesman problem: An overview of exact and approximate algorithmsEur J Opl Res19925923124710.1016/0377-2217(92)90138-Y
- LawlerELLenstraJKRinnooy KanAHGShmoysDBThe Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization1985
- LinSComputer solutions of the traveling salesman problemBell Syst Tech J1965442245226910.1002/j.1538-7305.1965.tb04146.x
- LinSKernighanBWAn effective heuristic algorithm for the traveling salesman problemOpns Res19732149851610.1287/opre.21.2.498
- LittleJDCMurtyKGSweeneyDWKarelCAn algorithm for the traveling salesman problemOpns Res19631197298910.1287/opre.11.6.972
- Martin GT (1966). Solving the traveling salesman problem by integer programming. Working Paper, CEIR, New York.
- MiliotisPInteger programming approaches to the travelling salesman problemMath Program19761037637810.1007/BF01580682
- MiliotisPUsing cutting planes to solve the symmetric travelling salesman problemMath Program19781517718810.1007/BF01609016
- NaddefDPolyhedral theory and branch-and-cut algorithms for the symmetric TSPThe Traveling Salesman Problem and Its Variations200229116
- ÖncanTAltınelIKLaporteGA comparative analysis of several asymmetric traveling salesman problem formulationsComput Opns Res20093663765410.1016/j.cor.2007.11.008
- Or I (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Il.
- OrmanAJWilliamsHPA survey of different integer programming formulations of the travelling salesman problemOptimisation, Econometric and Financial Analysis Advances in Computational Management Science200691104
- PadbergMWGrötschelMPolyhedral computationsThe Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization1985307360
- PadbergMWHongSOn the symmetric travelling salesman problem: A computational studyMath Program Study1980127810710.1007/BFb0120888
- PadbergMWRinaldiGOptimization of a 532-city symmetric traveling salesman problem by branch and cutOpns Res Lett198761710.1016/0167-6377(87)90002-2
- PadbergMWRinaldiGA branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problemsSIAM Rev1991336010010.1137/1033004
- Toth P and Vigo D (eds) (2002). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.