Effective algorithms for a bounded version of the uncapacitated TPP
From MaRDI portal
Recommendations
Cites work
- A branch and bound algorithm for the traveling purchaser problem
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- A heuristic approach for the travelling purchaser problem
- Approximate algorithms for the travelling purchaser problem
- Dynamic tabu search strategies for the traveling purchaser problem
- Heuristics for the traveling purchaser problem
- scientific article; zbMATH DE number 1405785 (Why is no real title available?)
- Improved solutions for the traveling purchaser problem.
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- The biobjective travelling purchaser problem
- Travelling purchaser problem
- Variable neighborhood search: Principles and applications
Cited in
(3)
This page was built for publication: Effective algorithms for a bounded version of the uncapacitated TPP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5850941)