The zone hopping problem

DOI10.1016/0305-0548(91)90044-RzbMath0713.90054OpenAlexW2045067538MaRDI QIDQ750298

Azita Kashani, Lawrence Bodin

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90044-r

zbMATH Keywords

knapsack problemzone hopping

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Zone skipping vs direct shipment of small orders: Integrating order processing and optimization ⋮ A special class parametric of knapsack problems: Analytic aids and heuristics ⋮ The zone hopping problem

Cites Work

• Unnamed Item
• The zone hopping problem
• The knapsack problem: A survey
• When the Greedy Solution Solves a Class of Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem

This page was built for publication: The zone hopping problem