Sequence Independent Lifting for Mixed-Integer Programming
From MaRDI portal
Publication:3637441
DOI10.1287/opre.1030.0099zbMath1165.90576OpenAlexW2158515702MaRDI QIDQ3637441
Publication date: 10 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1030.0099
Related Items
Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets, Theoretical challenges towards cutting-plane selection, Local cuts for mixed-integer programming, Lifting two-integer knapsack inequalities, Chance-Constrained Binary Packing Problems, Lifting for the integer knapsack cover polyhedron, Lifting for conic mixed-integer programming, Sequence independent lifting for mixed knapsack problems with GUB constraints, \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting, Mingling: mixed-integer rounding with bounds, On the exact separation of mixed integer knapsack cuts, Maximizing a class of submodular utility functions, The strength of multi-row models, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, Valid inequalities for mips and group polyhedra from approximate liftings, Risk-Averse Shortest Path Interdiction, Sequence independent lifting for a set of submodular maximization problems, Lifting for mixed integer programs with variable upper bounds, Cover and pack inequalities for (mixed) integer programming
