Valid Inequalities and Superadditivity for 0–1 Integer Programs
From MaRDI portal
Publication:4187583
Cited in
(35)- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Sequence independent lifting for a set of submodular maximization problems
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Lifting the knapsack cover inequalities for the knapsack polytope
- Sequence independent lifting of cover inequalities
- Lifting for the integer knapsack cover polyhedron
- The generalized assignment problem: Valid inequalities and facets
- Knapsack polytopes: a survey
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
- 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
- Generalized cover facet inequalities for the generalized assignment problem
- Cutting planes for the multistage stochastic unit commitment problem
- On the minimum cost multiple-source unsplittable flow problem
- On lifted cover inequalities: a new lifting procedure with unusual properties
- Lifting two-integer knapsack inequalities
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Lifting for mixed integer programs with variable upper bounds
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- Approximate and exact merging of knapsack constraints with cover inequalities
- Lifting for conic mixed-integer programming
- Cover and pack inequalities for (mixed) integer programming
- Sequence independent lifting for mixed knapsack problems with GUB constraints
- Flow pack facets of the single node fixed-charge flow polytope
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
- Cutting planes in integer and mixed integer programming
- Sequence independent lifting for mixed integer programs with variable upper bounds
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Maximizing a class of submodular utility functions with constraints
- Maximizing a class of submodular utility functions
This page was built for publication: Valid Inequalities and Superadditivity for 0–1 Integer Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187583)
