On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra

DOI10.1016/S0377-2217(99)00461-0zbMath0952.90028OpenAlexW2050047854MaRDI QIDQ1580978

Andrew J. Miller, Savelsbergh, Martin W. P., Nemhauser, George I.

Publication date: 14 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00461-0

zbMATH Keywords

integer programmingcapacitated lot-sizingcontinuous 0-1 knapsack problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Boolean programming (90C09)

Related Items

Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, A cross entropy algorithm for the Knapsack problem with setups, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Multi-product valid inequalities for the discrete lot-sizing and scheduling problem, A polyhedral study of lot-sizing with supplier selection, Capacitated lot-sizing with extensions: a review, A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times, A branch-and-cut algorithm for an assembly routing problem, On stochastic dynamic programming for solving large-scale planning problems under uncertainty, Single item lot sizing problems, A polyhedral approach to least cost influence maximization in social networks

Cites Work

• Unnamed Item
• Valid inequalities and separation for capacitated economic lot sizing
• The 0-1 knapsack problem with a single continuous variable
• A cutting plane approach to capacitated lot-sizing with start-up costs
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Facets and algorithms for capacitated lot sizing
• Sequence independent lifting in mixed integer programming
• Dynamic Version of the Economic Lot Size Model
• Uncapacitated lot-sizing: The convex hull of solutions
• Valid Inequalities and Superadditivity for 0–1 Integer Programs
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Deterministic Production Planning with Concave Costs and Capacity Constraints