10 search results - page 2 / 2 » On the strength of Gomory mixed-integer cuts as group cuts |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
MP
2006
13 years 7 months ago
2006
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...
MP
2006
13 years 7 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
ALMOB
2006
13 years 7 months ago
2006
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...