scientific article; zbMATH DE number 1225029

MaRDI QIDQ4219201zbMATH OpenFDO

Authors Peter Störmer

Publication date 19 November 1998

zbMATH Keywords

combinatorial optimization problemslinear ordering problemmax-cut problemtraveling salesman problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distributed algorithms (68W15) Operations research and management science (90B99)

Recommendations

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• scientific article; zbMATH DE number 1304530
• scientific article; zbMATH DE number 764414
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem

Cited in

(9)

• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• New parallel randomized algorithms for the traveling salesman problem
• Parallel branch, cut, and price for large-scale discrete optimization
• Solving large batches of traveling salesman problems with parallel and distributed computing
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• scientific article; zbMATH DE number 4093206 (Why is no real title available?)
• scientific article; zbMATH DE number 764414 (Why is no real title available?)
• A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut

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