Travelling purchaser problem

MaRDI QIDQ1156697zbMATH OpenFDO

Authors S. H. Smith

Publication date 1981

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

algorithmglobal optimal solutiontravelling salesmanlexicographic searchm marketsn commoditiestravelling purchaser problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited in

(28)

• Ant colony optimization for the traveling purchaser problem
• An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem
• Optimal capacitated ring trees
• A travelling salesman problem (TSP) with multiple job facilities.
• Improved heuristics for the traveling purchaser problem.
• Models for a traveling purchaser problem with additional side-constraints
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
• Effective algorithms for a bounded version of the uncapacitated TPP
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• Exploring greedy criteria for the dynamic traveling purchaser problem
• The traveling purchaser problem with fast service option
• An approach to efficient planning with numerical fluents and multi-criteria plan quality
• The traveling purchaser problem with budget constraint
• A heuristic approach for the travelling purchaser problem
• Solving the asymmetric traveling purchaser problem
• Transgenetic algorithm for the traveling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• The traveling purchaser problem and its variants
• Improved solutions for the traveling purchaser problem.
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
• The bi-objective traveling purchaser problem with deliveries
• Dynamic tabu search strategies for the traveling purchaser problem
• A variable neighborhood search algorithm for cost-balanced travelling salesman problem
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• The biobjective travelling purchaser problem

This page was built for publication: Travelling purchaser problem

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