Improved solutions for the traveling purchaser problem.

DOI10.1016/S0305-0548(98)00032-XzbMath1042.90632OpenAlexW1992398522MaRDI QIDQ1406699

R. C. Chien, Wen Lea Pearn

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00032-x

zbMATH Keywords

combinatoricscomplexitynetwork optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (17)

The bi-objective traveling purchaser problem with deliveries ⋮ The biobjective travelling purchaser problem ⋮ Ant colony optimization for the traveling purchaser problem ⋮ The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach ⋮ Solving the asymmetric traveling purchaser problem ⋮ The traveling purchaser problem with fast service option ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ Exploring greedy criteria for the dynamic traveling purchaser problem ⋮ Improved heuristics for the traveling purchaser problem. ⋮ The traveling purchaser problem and its variants ⋮ An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem ⋮ A heuristic approach for the travelling purchaser problem ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ The traveling purchaser problem with budget constraint ⋮ Transgenetic algorithm for the traveling purchaser problem ⋮ Effective Algorithms for a Bounded Version of the Uncapacitated TPP ⋮ Heuristics for the traveling purchaser problem

Cites Work

• An approximation algorithm for the TSP
• Travelling purchaser problem
• Approximate algorithms for the travelling purchaser problem

This page was built for publication: Improved solutions for the traveling purchaser problem.