Pages that link to "Item:Q4764349"
From MaRDI portal
The following pages link to Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes (Q4764349):
Displaying 13 items.
- Surrogate-RLT cuts for zero-one integer programs (Q330260) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- Second-order cover inequalities (Q927162) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Optimal multicast route packing (Q2378485) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)