Sequence Independent Lifting for Mixed-Integer Programming

DOI10.1287/OPRE.1030.0099MaRDI QIDQ3637441zbMATH OpenOpenAlexFDO

Authors Alper Atamtürk

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

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Sequence independent lifting in mixed integer programming
• Sequence independent lifting for mixed integer programs with variable upper bounds
• Sequence independent lifting for mixed knapsack problems with GUB constraints
• Sequence independent lifting for a set of submodular maximization problems
• A sequential linear programming approach to solve mixed integer programming problems
• Sequence Independent Lifting for the Set of Submodular Maximization Problem
• Sequential approach to the solution of mixed linear programs
• Lifting for mixed integer programs with variable upper bounds
• Lifting for conic mixed-integer programming
• scientific article; zbMATH DE number 3922378

Cited in

(26)

• Sequence independent lifting for a set of submodular maximization problems
• scientific article; zbMATH DE number 2086920 (Why is no real title available?)
• Sequence independent lifting of cover inequalities
• Lifting for the integer knapsack cover polyhedron
• Lifting convex inequalities for bipartite bilinear programs
• Lifting convex inequalities for bipartite bilinear programs
• Valid inequalities for mips and group polyhedra from approximate liftings
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
• Local cuts for mixed-integer programming
• Theoretical challenges towards cutting-plane selection
• Sequence Independent Lifting for the Set of Submodular Maximization Problem
• Lifting two-integer knapsack inequalities
• Lifting for mixed integer programs with variable upper bounds
• Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
• The strength of multi-row models
• Lifting for conic mixed-integer programming
• Cover and pack inequalities for (mixed) integer programming
• Sequence independent lifting for mixed knapsack problems with GUB constraints
• Mingling: mixed-integer rounding with bounds
• A note on valid inequalities for PageRank optimization with edge selection constraints
• On the exact separation of mixed integer knapsack cuts
• Sequence independent lifting for mixed integer programs with variable upper bounds
• Risk-averse shortest path interdiction
• Maximizing a class of submodular utility functions
• Chance-Constrained Binary Packing Problems
• \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set

This page was built for publication: Sequence Independent Lifting for Mixed-Integer Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637441)