Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

DOI10.1287/OPRE.21.1.340zbMath0266.90041OpenAlexW2035850032MaRDI QIDQ5684831

Publication date: 1973

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.21.1.340

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (5)

Branch-and-bound and parallel computation: A historical note ⋮ Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs ⋮ A randomized parallel branch-and-bound algorithm ⋮ The traveling salesman problem: An overview of exact and approximate algorithms ⋮ Cluster based branching for the asymmetric traveling salesman problem

This page was built for publication: Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem