Approximate algorithms for the travelling purchaser problem

DOI10.1016/0167-6377(82)90041-4MaRDI QIDQ1835850zbMATH OpenOpenAlexFDO

Authors Hoon Liong Ong

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

zbMATH Keywords

heuristicsapproximate algorithmsmachine schedulingcomputational resultstravelling salesmantravelling purchaser problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) 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)

Cites work

• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Travelling purchaser problem

Cited in

(24)

• Ant colony optimization for the traveling purchaser problem
• 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
• Approximating the tree and tour covers of a graph
• 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
• 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
• Automatic production planning of press brakes for sheet metal bending
• The traveling purchaser problem and its variants
• Improved solutions for the traveling purchaser problem.
• On symmetric subtour problems
• The bi-objective traveling purchaser problem with deliveries
• Dynamic tabu search strategies for the traveling purchaser problem
• Heuristics for the traveling purchaser problem
• The biobjective travelling purchaser problem
• Topological design of a two-level network with ring-star configuration

This page was built for publication: Approximate algorithms for the travelling purchaser problem

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