Traveling salesman problem with transportation

MaRDI QIDQ864099zbMATH OpenFDO

Authors Valeriu Ungureanu

Publication date 12 February 2007

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

zbMATH Keywords

computational complexity

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Recommendations

• scientific article; zbMATH DE number 795217
• A new generalization of the traveling salesman problem
• The traveling salesman problem. II: Exact methods
• A concise guide to the Traveling Salesman Problem
• A cutting plane procedure for the travelling salesman problem on road networks

Cited in

(9)

• Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction
• A New Application of the Traveling Salesman Problem: The Turkish Cashier Problem
• Models for Solving the Travelling Salesman Problem
• Traveling salesman problem
• scientific article; zbMATH DE number 1404429 (Why is no real title available?)
• Travelling salesman problem with Matlab programming
• scientific article; zbMATH DE number 2064404 (Why is no real title available?)
• The selective traveling salesman problem with emission allocation rules
• The Traveling Salesman Problem with Distances One and Two

This page was built for publication: Traveling salesman problem with transportation

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