Solving the asymmetric traveling purchaser problem

DOI10.1007/s10479-006-0014-yzbMath1151.90530OpenAlexW1980297434MaRDI QIDQ867540

Jorge Riera-Ledesma, Juan-José Salazar-González

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

zbMATH Keywords

traveling salesmen problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (12)

The bi-objective traveling purchaser problem with deliveries ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ The traveling purchaser problem with time-dependent quantities ⋮ Solving the asymmetric traveling purchaser problem ⋮ The traveling purchaser problem with fast service option ⋮ A GRASP/Path‐Relinking algorithm for the traveling purchaser problem ⋮ The traveling purchaser problem and its variants ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem ⋮ Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants

Uses Software

• ABACUS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Solving the asymmetric traveling purchaser problem