Solving the asymmetric traveling purchaser problem

DOI10.1007/S10479-006-0014-YMaRDI QIDQ867540zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A heuristic approach for the travelling purchaser problem
• Improved solutions for the traveling purchaser problem.
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• The traveling purchaser problem and its variants
• Models for a traveling purchaser problem with additional side-constraints

Cites work

• scientific article; zbMATH DE number 2064407 (Why is no real title available?)
• scientific article; zbMATH DE number 1517142 (Why is no real title available?)
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• A branch and bound algorithm for the 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
• Improved solutions for the traveling purchaser problem.
• Introduction to ABACUS -- a branch-and-cut system
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Sequencing many jobs on a multi-purpose facility
• Solving the asymmetric traveling purchaser problem
• Technical Note—A Note on Zero-One Programming
• Transforming asymmetric into symmetric traveling salesman problems
• Travelling purchaser problem

Cited in

(16)

• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
• The traveling purchaser problem with time-dependent quantities
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
• Models for a traveling purchaser problem with additional side-constraints
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• The traveling purchaser problem with fast service option
• Solving the asymmetric traveling purchaser problem
• The traveling purchaser problem and its variants
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• The bi-objective traveling purchaser problem with deliveries
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• The biobjective travelling purchaser problem
• The distance constrained multiple vehicle traveling purchaser problem

Describes a project that uses

Uses Software

• ABACUS

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

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