An improved branching rule for the symmetric travelling salesman problem

DOI10.1057/PALGRAVE.JORS.2601053MaRDI QIDQ4658394zbMATH OpenOpenAlexFDO

Authors Paul M. E. Shutler

Publication date 16 March 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601053

zbMATH Keywords

branch-and-boundtravelling salesman1-tree relaxation

Mathematics Subject Classification ID

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

Recommendations

• Branch-and-bound algorithm for symmetric travelling salesman problem
• The symmetric travelling salesman problem. II: New low bounds
• scientific article; zbMATH DE number 4031726
• New lower bounds for the symmetric travelling salesman problem
• A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem

Cited in

(8)

• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
• A note on relatives to the Held and Karp 1-tree problem
• Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
• Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
• Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization.
• The selective travelling salesman problem
• Branch-and-bound algorithm for symmetric travelling salesman problem
• Results for the close-enough traveling salesman problem with a branch-and-bound algorithm

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: An improved branching rule for the symmetric travelling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658394)