Cluster based branching for the asymmetric traveling salesman problem
From MaRDI portal
Publication:1806732
DOI10.1016/S0377-2217(99)00133-2zbMATH Open0933.90064OpenAlexW1971145728MaRDI QIDQ1806732FDOQ1806732
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
Recommendations
- The symmetric clustered traveling salesman problem
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- Graph-Theoretic Concepts in Computer Science
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- A Dynamic Programming Approach to Sequencing Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- A restricted Lagrangean approach to the traveling salesman problem
- An additive bounding procedure for the asymmetric travelling salesman problem
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- 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
Cited In (6)
- 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
- The symmetric clustered traveling salesman problem
- Graph-Theoretic Concepts in Computer Science
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope
Uses Software
This page was built for publication: Cluster based branching for the asymmetric traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806732)
