Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality

Citations

Cited by:

1. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
2. L. Fleischer & É. Tardos, 1999. "Separating Maximally Violated Comb Inequalities in Planar Graphs," Mathematics of Operations Research, INFORMS, vol. 24(1), pages 130-148, February.
3. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
4. George Nemhauser, 2007. "Hooked on IP," Annals of Operations Research, Springer, vol. 149(1), pages 157-161, February.
5. Bertsimas, Dimitris & Orlin, James B., 1953-., 1991. "A technique for speeding up the solution of the Lagrangean dual," Working papers 3278-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
6. Malaguti, Enrico & Martello, Silvano & Santini, Alberto, 2018. "The traveling salesman problem with pickups, deliveries, and draft limits," Omega, Elsevier, vol. 74(C), pages 50-58.
7. Martha G. Pilcher & Ronald L. Rardin, 1992. "Partial polyhedral description and generation of discrete optimization problems with known optima," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(6), pages 839-858, October.
8. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Discussion Paper 1995-57, Tilburg University, Center for Economic Research.
9. Dell’Amico, Mauro & Iori, Manuel & Novellani, Stefano & Subramanian, Anand, 2018. "The Bike sharing Rebalancing Problem with Stochastic Demands," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 362-380.
10. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
11. Chen, Hanwen & Liu, Siyi & Wang, Junjie & Wu, Zhijuan, 2022. "The effect of geographic proximity on corporate tax avoidance: Evidence from China," Journal of Corporate Finance, Elsevier, vol. 72(C).
12. Li, Xiang & Zhou, Jiandong & Zhao, Xiande, 2016. "Travel itinerary problem," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 332-343.
13. Ghosh, Diptesh & Sumanta Basu, 2011. "Diversified Local Search for the Traveling Salesman Problem," IIMA Working Papers WP2011-01-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
14. Rafael Martinelli & Claudio Contardo, 2015. "Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 658-676, November.
15. Santanu S. Dey & Jean-Philippe Richard, 2009. "Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 137-150, February.
16. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
17. N. R. Achuthan & L. Caccetta & S. P. Hill, 2003. "An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 37(2), pages 153-169, May.
18. Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
19. Denis Naddef & Yves Pochet, 2001. "The Symmetric Traveling Salesman Polytope Revisited," Mathematics of Operations Research, INFORMS, vol. 26(4), pages 700-722, November.
20. Ulrich Pferschy & Rostislav Staněk, 2017. "Generating subtour elimination constraints for the TSP from pure integer solutions," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(1), pages 231-260, March.
21. H Tang & E Miller-Hooks, 2005. "Algorithms for a stochastic selective travelling salesperson problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 439-452, April.
22. Hanif D. Sherali & Patrick J. Driscoll, 2002. "On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems," Operations Research, INFORMS, vol. 50(4), pages 656-669, August.
23. Gorka Kobeaga & María Merino & Jose A. Lozano, 2021. "On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms," Annals of Operations Research, Springer, vol. 305(1), pages 107-136, October.
24. Denis Naddef & Giovanni Rinaldi, 2007. "The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 233-256, February.
25. G Laporte, 2010. "A concise guide to the Traveling Salesman Problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 35-40, January.
26. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.