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

approximate algorithmscomputational resultsheuristicsmachine schedulingtravelling purchaser problemtravelling salesman

Mathematics Subject Classification ID

Paths and cycles (05C38) Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35) Applications of graph theory to circuits and networks (94C15)

Cites work

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

Cited in

(25)

• The traveling purchaser problem with budget constraint
• Transgenetic algorithm for the traveling purchaser problem
• On symmetric subtour problems
• A branch and bound algorithm for the traveling purchaser problem
• Improved solutions for the traveling purchaser problem.
• Improved heuristics for the traveling purchaser problem.
• The bi-objective traveling purchaser problem with deliveries
• The traveling purchaser problem and its variants
• Heuristics for the traveling purchaser problem
• The biobjective travelling purchaser problem
• Dynamic tabu search strategies for the traveling purchaser problem
• Topological design of a two-level network with ring-star configuration
• Ant colony optimization for the traveling purchaser problem
• The traveling purchaser problem with fast service option
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
• Automatic production planning of press brakes for sheet metal bending
• Effective algorithms for a bounded version of the uncapacitated TPP
• 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
• Approximating the tree and tour covers of a graph
• A heuristic approach for the travelling purchaser problem
• Models for a traveling purchaser problem with additional side-constraints
• Modeling and planning a novel logistic transport system: several drone pickups for each delivery
• Solving the asymmetric traveling purchaser problem

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)