scientific article; zbMATH DE number 7310206

zbMath1499.90183MaRDI QIDQ5150579

Yu. L. Kostyuk

Publication date: 15 February 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

travelling salesman problembranch-and-bound methodcomputing experiment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Algorithms in computer science (68W99)

Related Items (1)

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

Cites Work

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

This page was built for publication: