Approved by: CUTTING PLANES FOR LARGE MIXED INTEGER PROGRAMMING MODELS (2006)
G. Goycoolea, William J. Cook, George L. Nemhauser, Ellis L. Johnson, Robin Thomas, Zonghao Gu
MIP: Theory and practice – closing the gap (2000)
Robert E. Bixby, Mary Fenelon, Zonghao Gu
As above
Sequence independent lifting in mixed integer programming (2000)
Zonghao Gu, George L. Nemhauser
We investigate lifting, i.e., the process of taking a valid inequality for a polyhedron and extending it to a valid inequality in a higher dimensional space. Lifting is usually applied sequentially,...
Lifted Cover Inequalities for 0-1 Integer Programs: Computation (1998)
Zonghao Gu, George L. Nemhauser
We investigate the algorithmic and implementation issues related to the e ective and e cient use of lifted cover inequalities and lifted GUB cover inequalities in a branch-and-cut algorithm for 0-1...
Lifted Cover Inequalities for 0-1 Integer Programs: Computation (1998)
Zonghao Gu, George L. Nemhauser
We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer programming based on lifted cover inequalities (LCIs). We show that given a fractional point, determining...
Sequence Independent Lifting in Mixed Integer Programming (1998)
Zonghao Gu, George L. Nemhauser
We investigate lifting, i.e., the process of taking a valid inequality for a polyhedron and extending it to a valid inequality in a higher dimensional space. Lifting is usually applied sequentially,...
Lifted Cover Inequalities for 0-1 Integer Programs: Computation (1998)
Zonghao Gu, George L. Nemhauser
We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer programming based on lifted cover inequalities (LCIs). We showthat given a fractional point, determining...
Lifted Cover Inequalities for 0-1 Integer Programs: Computation (1997)
Zonghao Gu, George L. Nemhauser
We investigate the algorithmic and implementation issues related to the effective and efficient use of lifted cover inequalities and lifted GUB cover inequalities in a branch-and-cut algorithm for...
Lifted Flow Cover Inequalities for Mixed 0-1 Integer Programs (1996)
Zonghao Gu, George L. Nemhauser
We investigate strong inequalities for mixed 0-1 integer programs derived from flow cover inequalities. Flow cover inequalities are usually not facet defining and need to be lifted to obtain stronger...