scientific article; zbMATH DE number 6178353

MaRDI QIDQ4926005zbMATH OpenFDO

Authors Jie Bai, J. Zhu, Chang-Chun Pan, Genke Yang

Publication date 20 June 2013

zbMATH Keywords

ant colony-optimizationarc-excluding algorithmasymmetric traveling salesman problemcombinatorial optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
• A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• A constant-factor approximation algorithm for the asymmetric traveling salesman problem
• An effective hybrid harmony search for the asymmetric travelling salesman problem
• A threshold constraint based depth-first-search branch-bound algorithm for solving asymmetric traveling salesman problems
• A new memetic algorithm for the asymmetric traveling salesman problem
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• scientific article; zbMATH DE number 4029299

Cited in

(1)

• High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4926005)