Pages that link to "Item:Q4187583"
From MaRDI portal
The following pages link to Valid Inequalities and Superadditivity for 0–1 Integer Programs (Q4187583):
Displaying 35 items.
- Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- Maximizing a class of submodular utility functions with constraints (Q517299) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Lifting for conic mixed-integer programming (Q623366) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
- On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
- Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
- Generalized cover facet inequalities for the generalized assignment problem (Q3553764) (← links)
- Sequence independent lifting of cover inequalities (Q5101436) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
