Lifted inequalities for 0-1 mixed integer programming: superlinear lifting

DOI10.1007/S10107-003-0399-1zbMath1082.90065OpenAlexW1995151259MaRDI QIDQ1424282

Jean-Philippe P. Richard, Ismael Regis jun. de Farias, Nemhauser, George I.

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

zbMATH Keywords

polyhedral theory0-1 mixed integer programmingsuperlinear lifting

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)

Related Items (12)

Knapsack polytopes: a survey ⋮ Lifting inequalities: a framework for generating strong cuts for nonlinear programs ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ Lifting for the integer knapsack cover polyhedron ⋮ Lifting for conic mixed-integer programming ⋮ Lifting, superadditivity, mixed integer rounding and single node flow sets revisited ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Valid inequalities for mips and group polyhedra from approximate liftings ⋮ Sequence independent lifting for mixed integer programs with variable upper bounds ⋮ Lifting for mixed integer programs with variable upper bounds ⋮ A polyhedral approach to least cost influence maximization in social networks

This page was built for publication: Lifted inequalities for 0-1 mixed integer programming: superlinear lifting