A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
From MaRDI portal
Publication:410535
DOI10.1155/2011/750968zbMath1235.90123WikidataQ58693426 ScholiaQ58693426MaRDI QIDQ410535
Publication date: 3 April 2012
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/750968
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis, An exact algorithm for the clustered travelling salesman problem, Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transforming asymmetric into symmetric traveling salesman problems
- A comparative analysis of several asymmetric traveling salesman problem formulations
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- The travelling salesman problem with precedence constraints.
- Tolerance-based branch and bound algorithms for the ATSP
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Algorithm 750: CDT
- The Loading Problem