Sciweavers

205 search results - page 2 / 41
» Valid inequalities for mixed integer linear programs
Sort
View
ANOR
2007
126views more  ANOR 2007»
13 years 7 months ago
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
Quentin Louveaux, Laurence A. Wolsey
MP
2011
13 years 2 months ago
Lifting for conic mixed-integer programming
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very e...
Alper Atamtürk, Vishnu Narayanan
IPCO
2007
109views Optimization» more  IPCO 2007»
13 years 8 months ago
Inequalities from Two Rows of a Simplex Tableau
In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice poin...
Kent Andersen, Quentin Louveaux, Robert Weismantel...
IPCO
2004
100views Optimization» more  IPCO 2004»
13 years 8 months ago
Valid Inequalities Based on Simple Mixed-Integer Sets
In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these ine...
Sanjeeb Dash, Oktay Günlük
IOR
2010
86views more  IOR 2010»
13 years 5 months ago
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
Lewis Ntaimo