Valid inequalities for mips and group polyhedra from approximate liftings
From MaRDI portal
Publication:1016121
DOI10.1007/s10107-007-0190-9zbMath1171.90006MaRDI QIDQ1016121
Yanjun Li, Jean-Philippe P. Richard, Lisa A. Miller
Publication date: 4 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0190-9
90C10: Integer programming
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
On the extreme inequalities of infinite group problems, Relations between facets of low- and high-dimensional group problems
Cites Work
- Unnamed Item
- Unnamed Item
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Sequence independent lifting in mixed integer programming
- Valid inequalities based on the interpolation procedure
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
- Integer Programming and Pricing
- Sequence Independent Lifting for Mixed-Integer Programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- On the facial structure of set packing polyhedra
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
