Efficient optimization of the Held-Karp lower bound

DOI10.5802/ojmo.11zbMath1497.90183OpenAlexW3212135477MaRDI QIDQ2165584

Giovanni Righini

Publication date: 20 August 2022

Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5802/ojmo.11

zbMATH Keywords

traveling salesman problemminimum spanning treeHeld-Karp lower boundunion-find data-structure

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• Analysis of the Held-Karp lower bound for the asymmetric TSP
• Estimating the Held-Karp lower bound for the geometric TSP
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The traveling salesman problem and its variations.
• Improving the Held and Karp Approach with Constraint Programming
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: Efficient optimization of the Held-Karp lower bound