scientific article; zbMATH DE number 1947373

MaRDI QIDQ4411337zbMATH OpenFDO

Authors William Cook

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610001.htm

Mathematics Subject Classification ID

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

Recommendations

• On the solution of traveling salesman problems
• An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
• scientific article; zbMATH DE number 795217
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Solution of large-scale symmetric travelling salesman problems

Cited in

(24)

• A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• The travelling salesman problem for finite-sized cities
• A New Application of the Traveling Salesman Problem: The Turkish Cashier Problem
• POPMUSIC for the travelling salesman problem
• Solution of a traveling salesman problem in computer component design
• The traveling salesman problem and its variations
• Traveling salesman path problems
• The balanced traveling salesman problem
• Pyramidal traveling salesman problem
• A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks
• Finding good tours for huge Euclidean TSP instances by iterative backbone contraction
• scientific article; zbMATH DE number 4191408 (Why is no real title available?)
• Generating Travelling-Salesman Problems with Known Optimal Tours
• Edge elimination in TSP instances
• Traveling salesman problem
• Chained Lin-Kernighan for large traveling salesman problems
• Certification of an optimal TSP tour through 85,900 cities
• The solution of some 100-city travelling salesman problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Computing the variance of tour costs over the solution space of the TSP in polynomial time
• The Solution of Travelling Salesman Problems Based on Industrial Data
• Directed travelling salesman problem
• Solution of a large-scale traveling-salesman problem

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 Q4411337)