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

zbMATH Open1183.90350MaRDI QIDQ3402682FDOQ3402682

Genke Yang, Chang-Chun Pan, Yi Zhu

Publication date: 12 February 2010

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

zbMATH Keywords

schedulingasymmetric traveling salesman problembranch-bound algorithm

Mathematics Subject Classification ID

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

Cited In (3)

• Iterative patching and the asymmetric traveling salesman problem
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• Title not available (Why is that?)

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)