A data-guided lexisearch algorithm for the asymmetric traveling salesman problem

DOI10.1155/2011/750968zbMath1235.90123OpenAlexW1964057427WikidataQ58693426 ScholiaQ58693426MaRDI QIDQ410535

Zakir Hussain Ahmed

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem ⋮ An exact algorithm for the clustered 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

This page was built for publication: A data-guided lexisearch algorithm for the asymmetric traveling salesman problem