A threshold constraint based depth-first-search branch-bound algorithm for solving asymmetric traveling salesman problems

MaRDI QIDQ3402682zbMATH OpenFDO

Authors Yi Zhu, Chang-Chun Pan, Genke Yang

Publication date 12 February 2010

zbMATH Keywords

asymmetric traveling salesman problembranch-bound algorithmscheduling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• Exact solution of large-scale, asymmetric traveling salesman problems
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints

Cited in

(3)

• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• Iterative patching and the asymmetric traveling salesman problem
• scientific article; zbMATH DE number 6178353 (Why is no real title available?)

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: A threshold constraint based depth-first-search branch-bound algorithm for solving asymmetric traveling salesman problems

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