An improved branching rule for the symmetric travelling salesman problem

DOI10.1057/PALGRAVE.JORS.2601053zbMath1131.90444OpenAlexW2030604727MaRDI QIDQ4658394

Paul M. E. Shutler

Publication date: 16 March 2005

Published in: 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)

Related Items (3)

Managing spatio-temporal complexity in Hopfield neural network simulations for large-scale static optimization. ⋮ A note on relatives to the Held and Karp 1-tree problem ⋮ Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem

Uses Software

• Unnamed Item

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