The symmetric travelling salesman problem. II: New low bounds

DOI10.1134/S0005117910040090zbMath1206.90154MaRDI QIDQ1956919

S. I. Sergeev

Publication date: 24 September 2010

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

Fast algorithm to find 2-factor of minimum weight ⋮ Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem. I: Theoretical issues
• Computer algorithms for the solution of some linear and linear integer programming problems. I-IV
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• Algorithms for the minimax problem of the travelling salesman. II: Dual approach
• The traveling salesman problem and its variations
• The quadratic assignment problem. I: New lower bounds in paired assignment
• Improved lower bounds for the quadratic assignment problem
• The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
• A restricted Lagrangean approach to the traveling salesman problem
• Integer programming approaches to the travelling salesman problem
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: The symmetric travelling salesman problem. II: New low bounds