Technical Note—Some Very Easy Knapsack/Partition Problems

DOI10.1287/opre.33.5.1154zbMath0581.90063OpenAlexW2098740332MaRDI QIDQ3703590

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

clusteringlot-sizingindistinguishable objectsknapsack/partition problemspartitioning a group

Mathematics Subject Classification ID

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

Related Items (2)

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

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