26 search results - page 4 / 6 » Two-Step MIR Inequalities for Mixed Integer Programs |
JGO
2008
13 years 7 months ago
2008
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
IOR
2006
13 years 7 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
ORL
2008
13 years 7 months ago
2008
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
ENDM
2010
13 years 4 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
EOR
2000
13 years 7 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...