Technical Note—Some Very Easy Knapsack/Partition Problems

DOI10.1287/OPRE.33.5.1154MaRDI QIDQ3703590zbMATH OpenOpenAlexFDO

Authors James B. Orlin

Publication date 1985

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.33.5.1154

zbMATH Keywords

clusteringindistinguishable objectsknapsack/partition problemslot-sizingpartitioning a group

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1302173
• Knapsack problems with setups
• On pleasant but not completely pleasant knapsack problems
• 0-1 knapsack problems
• scientific article; zbMATH DE number 1783857
• Algorithms for some hard knapsack problems
• Easily Computable Facets of the Knapsack Polytope
• A hard knapsack problem
• On Pleasant Knapsack Problems
• scientific article; zbMATH DE number 4005976

Cited in

(3)

• The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
• A note on ``A multi-period profit maximizing model for retail supply chain management
• Structured Partitioning Problems

This page was built for publication: Technical Note—Some Very Easy Knapsack/Partition Problems

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