Pages that link to "Item:Q951099"
From MaRDI portal
The following pages link to Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099):
Displaying 17 items.
- Implicit cover inequalities (Q266036) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Lifting and separation of robust cover inequalities (Q4686680) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)
