THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION

DOI10.17223/20710410/45/12zbMath1459.90183OpenAlexW2987028216MaRDI QIDQ5151281

Yu. L. Kostyuk

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm677

zbMATH Keywords

local searchtraveling salesman problemcomputational experimentapproximate algorithmbranch-and-border method

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The traveling salesman problem. Approximate algorithms
• The traveling salesman problem. II: Exact methods
• An Algorithm for the Traveling Salesman Problem

This page was built for publication: THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION