Abstract. The lot–sizing polytope is a fundamental structure contained in many practical production planning problems. Here we study this polytope and identify facet–defining inequalities that cut off all fractional extreme points of its linear programming relaxation, as well as liftings from those facets. We give a polynomial–time combinatorial separation algorithm for the inequalities when capacities are constant. We also report computational experiments on solving the lot–sizing problem with varying cost and capacity characteristics. 1.
|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
782
|
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2. SpringerVerlag
– Grötschel, Lovász, et al.
- 1988
|
|
731
|
Integer and Combinatorial Optimization
– Nemhauser, Wolsey
- 1988
|
|
228
|
The ellipsoid method and its consequences in combinatorial optimization
– Lovasz, Schrijver
- 1981
|
|
101
|
Solving Airline CrewScheduling Problems by Branch-and-Cut
– HOFFMAN, PADBERG
- 1993
|
|
96
|
Solving Large-Scale Zero-One Linear Programming Problems
– Crowder, Johnson, et al.
- 1982
|
|
77
|
On the facial structure of set packing polyhedra
– Padberg
- 1973
|
|
55
|
Dynamic version of the economic lot sizing model
– Wagner, Whitin
- 1958
|
|
48
|
Facets of the knapsack polytope
– Balas
- 1975
|
|
46
|
Capacitated Network Design–Polyhedral Structure and Computation
– Bienstock, Günlük
- 1996
|
|
43
|
Minimum Cost Capacity Installation for Multicommodity Network Flows
– Bienstock, Chopra, et al.
- 1998
|
|
40
|
Valid Linear Inequalities for Fixed Charge Problems
– PADBERG, ROY, et al.
- 1985
|
|
40
|
Faces for a linear inequality in 0-1 variables
– Wolsey
- 1975
|
|
40
|
Modeling and Solving the Two-Facility Capacitated Network Loading Problem
– Magnanti, Mirchandani, et al.
- 1995
|
|
38
|
An updated mixed integer programming library: MIPLIB 3.0
– Bixby, Ceria, et al.
- 1998
|
|
36
|
On linear characterizations of combinatorial optimization problems
– Karp, Papadimitriou
- 1982
|
|
32
|
a mixed integer optimizer
– Minto
- 1994
|
|
32
|
Preprocessing and probing techniques for mixed integer programming problems
– Savelsbergh
- 1994
|
|
28
|
The Convex Hull of Two Core Capacitated Network Design Problems
– Magnanti, Mirchandani, et al.
- 1993
|
|
27
|
The 0–1 Knapsack Problem with a Single Continuous Variable
– MARCHAND, WOLSEY
- 1999
|
|
26
|
A simple forward algorithm to solve general dynamic lot sizing models with n periods in O�nlog n� or O�n� time. Management Sci
– Federgruen, Tzur
- 1991
|
|
26
|
Lifted cover inequalities for 0-1 integer programs: Complexity
– Gu, Nemhauser, et al.
- 1999
|
|
25
|
Aggregation and mixed integer rounding to solve MIPs
– Marchand, Wolsey
- 2001
|
|
25
|
Facets and strong valid inequalities for integer programs
– Wolsey
- 1976
|
|
25
|
A branch-and-cut algorithm for capacitated network design problems
– Gunluk
- 1999
|
|
24
|
Valid inequalities and superadditivity for 0/1 integer programs
– Wolsey
- 1977
|
|
24
|
A strong cutting plane/branchand-bound algorithm for node packing
– Nemhauser, Sigismondi
- 1992
|
|
23
|
Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
– Barnhart, Hane, et al.
|
|
23
|
bc-opt: a branch-and-cut code for mixed integer programs
– Cordier, Marchand, et al.
- 1999
|
|
23
|
Facets of regular 0-1 polytopes
– Hammer, Johnson, et al.
- 1975
|
|
21
|
Valid inequalities and separation for capacitated economic lot sizing
– Pochet
- 1988
|
|
21
|
Lot-sizing with constant batches: formulation and valid inequalities
– Pochet, Wolsey
- 1993
|
|
21
|
On capacitated network design cut-set polyhedra
– Atamtürk
- 2002
|
|
21
|
Valid inequalities for mixed 0-1 programs
– Roy, Wolsey
- 1986
|
|
20
|
On the 0/1 knapsack polytope
– Weismantel
- 1997
|
|
19
|
Economic Lot Sizing: An O(n log n) Algorithm that Runs
– Wagelmans, Hoesel, et al.
- 1992
|
|
19
|
Covering, packing and knapsack problems
– Padberg
- 1979
|
|
18
|
Cutting planes for integer programs with general integer variables
– Ceria, Cordier, et al.
- 1998
|
|
17
|
Uncapacitated lot sizing: The convex hull of solutions
– Barany, Roy, et al.
- 1984
|
|
16
|
Backbone network design tools with economic tradeoffs
– Gavish
- 1990
|
|
16
|
Shortest paths, single origin-destination network design and associated polyhedra, Networks 23
– Magnanti, Mirchandani
- 1993
|
|
15
|
Deterministic Production Planning with Concave Costs and Capacity Constraints
– Florian, Klein
- 1971
|
|
15
|
Polyhedra for lot-sizing with WagnerWhitin costs
– Pochet, Wolsey
- 1994
|
|
15
|
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization, and separation
– Pochet, Wolsey
- 1995
|
|
15
|
Modeling and strong linear programs for mixed integer programming
– Johnson
- 1989
|
|
14
|
Computational complexity of the capacitated lot size problem
– Bitran, Yanasse
- 1982
|
|
14
|
Designing private line networks - polyhedral analysis and computation
– Brockmüller, Günlük, et al.
- 1996
|
|
13
|
Conflict graphs in solving integer programming problems
– Atamtürk, Nemhauser, et al.
- 2000
|
|
13
|
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
– Minoux
- 1987
|
|
12
|
Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
– Wolsey
- 2002
|
