On the symmetric travelling salesman problem: Solution of a 120-city problem

DOI10.1007/BFb0120887zbMath0435.90070OpenAlexW83064900MaRDI QIDQ3875699

Publication date: 1980

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120887

zbMATH Keywords

cutting planes facets computational study large-scale problem symmetric travelling salesman problem travelling salesman polytope shortest roundtrip

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Related Items

Optimization of a 532-city symmetric traveling salesman problem by branch and cut, A polyhedral approach to the rural postman problem, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), A new class of cutting planes for the symmetric travelling salesman problem, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, Distance conserving reductions for nonoriented networks, Strong formulations for mixed integer programming: A survey, Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies, The symmetric traveling salesman problem and edge exchanges in minimal 1- trees, The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, Travelling salesman problem tools for microcomputers, Separating maximally violated comb inequalities in planar graphs, Point-to-point and multi-goal path planning for industrial robots, Polyhedral study of the capacitated vehicle routing problem, Branch and cut methods for network optimization, A branch and bound algorithm for the capacitated vehicle routing problem, The trouble with the second quantifier, Polyhedral techniques in combinatorial optimization I: Theory, Computing in combinatorial optimization, Recent trends in combinatorial optimization, A cutting-plane approach to the edge-weighted maximal clique problem, Optimizing over the subtour polytope of the travelling salesman problem, A cutting plane procedure for the travelling salesman problem on road networks