Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
From MaRDI portal
Publication:1424282
DOI10.1007/s10107-003-0399-1zbMath1082.90065MaRDI QIDQ1424282
Nemhauser, George I., Jean-Philippe P. Richard, Ismael Regis jun. de Farias
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0399-1
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C09: Boolean programming
Related Items
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, Lifting for conic mixed-integer programming, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Valid inequalities for mips and group polyhedra from approximate liftings, A computational analysis of lower bounds for big bucket production planning problems, Sequence independent lifting for mixed integer programs with variable upper bounds