Lower tolerance-based branch and bound algorithms for the ATSP

DOI10.1016/j.cor.2011.04.003zbMath1251.90319MaRDI QIDQ1761975

Boris I. Goldengorin, Remco Germs, Marcel Turkensteen

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.04.003

zbMATH Keywords

branch and bound; asymmetric traveling salesman problem; tolerances

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

Efficient computation of tolerances in the weighted independent set problem for trees, Extremal values of global tolerances in combinatorial optimization with an additive objective function, The effect of the asymmetry of road transportation networks on the traveling salesman problem, Global tolerances in the problems of combinatorial optimization with an additive objective function

Uses Software

• TSPLIB
• LKH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving the Hungarian assignment algorithm
• On the solution of traveling salesman problems
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Branching rules revisited
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• Tolerance-based branch and bound algorithms for the ATSP
• An addendum on: ``Sensitivity analysis of the optimal assignment
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• TSPLIB—A Traveling Salesman Problem Library
• Exact solution of large-scale, asymmetric traveling salesman problems
• Some Basics on Tolerances
• Graph-Theoretic Concepts in Computer Science