The zone hopping problem

DOI10.1016/0305-0548(91)90044-RMaRDI QIDQ750298zbMATH OpenOpenAlexFDO

Authors Lawrence Bodin, Azita Kashani

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

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

Recommendations

• Packing while traveling: mixed integer programming for a class of nonlinear knapsack problems
• scientific article; zbMATH DE number 1302173
• Approximate and exact algorithms for the fixed-charge knapsack problem
• scientific article; zbMATH DE number 44282
• A solution method for a knapsack problem and its variant

Cites work

• scientific article; zbMATH DE number 3606216 (Why is no real title available?)
• Approximate Algorithms for the 0/1 Knapsack Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• The knapsack problem: A survey
• The zone hopping problem
• When the Greedy Solution Solves a Class of Knapsack Problems

Cited in

(3)

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

This page was built for publication: The zone hopping problem

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