Cluster based branching for the asymmetric traveling salesman problem
From MaRDI portal
Publication:1806732
DOI10.1016/S0377-2217(99)00133-2zbMath0933.90064OpenAlexW1971145728MaRDI QIDQ1806732
Publication date: 4 April 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00133-2
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (3)
A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Multiprogramming genetic algorithm for optimization problems with permutation property ⋮ An efficient genetic algorithm for the traveling salesman problem with precedence constraints
Uses Software
Cites Work
- An additive bounding procedure for the asymmetric travelling salesman problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A Dynamic Programming Approach to Sequencing Problems
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- A restricted Lagrangean approach to the traveling salesman problem
- TSPLIB—A Traveling Salesman Problem Library
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- Technical Note—Bounds for the Travelling-Salesman Problem
- Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
This page was built for publication: Cluster based branching for the asymmetric traveling salesman problem
