205 search results - page 5 / 41 » Valid inequalities for mixed integer linear programs |
EOR
2000
13 years 8 months ago
2000
We consider the single itemcapacitated lot{sizingproblem, a well-known productionplanningmodelthat often arises in practical applications, and derive new classes of valid inequali...
ANOR
2005
13 years 8 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
MP
2006
13 years 8 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
SIAMJO
2008
13 years 8 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
MP
2006
13 years 8 months ago
2006
This paper addresses a multi-stage stochastic integer programming formulation of the uncapacitated lot-sizing problem under uncertainty. We show that the classical ( , S) inequalit...