Sciweavers

26 search results - page 2 / 6
» Two-Step MIR Inequalities for Mixed Integer Programs
Sort
View
ANOR
2007
126views more  ANOR 2007»
13 years 5 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
IPCO
2007
109views Optimization» more  IPCO 2007»
13 years 6 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...
MP
2006
78views more  MP 2006»
13 years 5 months ago
Valid inequalities based on the interpolation procedure
We study the interpolation procedure of Gomory and Johnson (1972), which generates cutting planes for general integer programs from facets of cyclic group polyhedra. This idea has...
Sanjeeb Dash, Oktay Günlük
COR
2006
86views more  COR 2006»
13 years 5 months ago
Parametric tabu-search for mixed integer programs
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
Fred Glover