Solving the asymmetric traveling purchaser problem
From MaRDI portal
Publication:867540
DOI10.1007/s10479-006-0014-yzbMath1151.90530MaRDI QIDQ867540
Juan-José Salazar-González, Jorge Riera-Ledesma
Publication date: 15 February 2007
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0014-y
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Models for a traveling purchaser problem with additional side-constraints, Solving the asymmetric traveling purchaser problem
Uses Software
Cites Work
- A heuristic approach for the travelling purchaser problem
- Transforming asymmetric into symmetric traveling salesman problems
- Solving the asymmetric traveling purchaser problem
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Travelling purchaser problem
- Introduction to ABACUS -- a branch-and-cut system
- A branch and bound algorithm for the traveling purchaser problem
- Improved solutions for the traveling purchaser problem.
- Approximate algorithms for the travelling purchaser problem
- Heuristics for the traveling purchaser problem
- Dynamic tabu search strategies for the traveling purchaser problem
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
- Technical Note—A Note on Zero-One Programming
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- Sequencing many jobs on a multi-purpose facility
- Unnamed Item
- Unnamed Item
- Unnamed Item
