On the capacitated lot-sizing and continuous 0–1 knapsack polyhedra
- 1 September 2000
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 125 (2), 298-315
- https://doi.org/10.1016/s0377-2217(99)00461-0
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Sequence Independent Lifting in Mixed Integer ProgrammingJournal of Combinatorial Optimization, 2000
- Lifted flow cover inequalities for mixed 0-1 integer programsMathematical Programming, 1999
- The 0-1 Knapsack problem with a single continuous variableMathematical Programming, 1999
- A cutting plane approach to capacitated lot-sizing with start-up costsMathematical Programming, 1996
- Polyhedra for lot-sizing with Wagner—Whitin costsMathematical Programming, 1994
- Lot-Sizing with Constant Batches: Formulation and Valid InequalitiesMathematics of Operations Research, 1993
- Facets and algorithms for capacitated lot sizingMathematical Programming, 1989
- Valid inequalities and separation for capacitated economic lot sizingOperations Research Letters, 1988
- Uncapacitated lot-sizing: The convex hull of solutionsPublished by Springer Science and Business Media LLC ,1984
- Deterministic Production Planning with Concave Costs and Capacity ConstraintsManagement Science, 1971