Approximate algorithms for the travelling purchaser problem
From MaRDI portal
Publication:1835850
DOI10.1016/0167-6377(82)90041-4zbMath0504.90078OpenAlexW2075693416MaRDI QIDQ1835850
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90041-4
heuristicsmachine schedulingcomputational resultstravelling salesmanapproximate algorithmstravelling purchaser problem
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)
Related Items
The bi-objective traveling purchaser problem with deliveries ⋮ Topological design of a two-level network with ring-star configuration ⋮ 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 ⋮ Dynamic tabu search strategies for the 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 with stochastic prices: exact and approximate algorithms ⋮ Exploring greedy criteria for the dynamic traveling purchaser problem ⋮ Improved solutions for the traveling purchaser problem. ⋮ Improved heuristics for the traveling purchaser problem. ⋮ The traveling purchaser problem and its variants ⋮ Approximating the tree and tour covers of a graph ⋮ On symmetric subtour problems ⋮ 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 ⋮ A branch and bound algorithm for the traveling purchaser problem ⋮ Transgenetic algorithm for the traveling purchaser problem ⋮ Effective Algorithms for a Bounded Version of the Uncapacitated TPP ⋮ Automatic production planning of press brakes for sheet metal bending ⋮ Heuristics for the traveling purchaser problem
Cites Work
