Lot-sizing polyhedra with a cardinality constraint

DOI10.1016/0167-6377(92)90056-9zbMath0764.90064OpenAlexW2044867063MaRDI QIDQ1198618

Laurence A. Wolsey, El-Houssaine Aghezzaf

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90056-9

zbMATH Keywords

cardinality constraintmixed 0-1 polyhedrauncapaciated lot-sizing polyhedra

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items (3)

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Polyhedra for lot-sizing with Wagner-Whitin costs

Cites Work

• Unnamed Item
• Unnamed Item
• Forest covers and a polyhedral intersection theorem
• Dynamic Version of the Economic Lot Size Model
• Uncapacitated lot-sizing: The convex hull of solutions
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• An efficient algorithm for minimumk-covers in weighted graphs

This page was built for publication: Lot-sizing polyhedra with a cardinality constraint