Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
From MaRDI portal
(Redirected from Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms)
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (scientific article; zbMATH DE number 2086920)
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (scientific article; zbMATH DE number 2086920)
Recommendations
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- The 0-1 knapsack problem with a single continuous variable
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- On the facets of the mixed-integer knapsack polyhedron
- Sequence Independent Lifting for Mixed-Integer Programming
Cited in
(9)- The 0-1 knapsack problem with a single continuous variable
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Lifting for mixed integer programs with variable upper bounds
- A polyhedral study of the semi-continuous knapsack problem
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Lifting two-integer knapsack inequalities
This page was built for publication: Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737525)