Traveling salesman problem with transportation

zbMATH Open1136.90033MaRDI QIDQ864099FDOQ864099

Authors: Valeriu Ungureanu 

Publication date: 12 February 2007

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

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

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)

Cited In (9)

• Models for Solving the Travelling Salesman Problem
• The Traveling Salesman Problem with Distances One and Two
• Travelling salesman problem with Matlab programming
• Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction
• Traveling salesman problem
• A New Application of the Traveling Salesman Problem: The Turkish Cashier Problem
• Title not available (Why is that?)
• The selective traveling salesman problem with emission allocation rules
• Title not available (Why is that?)

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)