Pages that link to "Item:Q2581317"
From MaRDI portal
The following pages link to Simple lifted cover inequalities and hard knapsack problems (Q2581317):
Displaying 14 items.
- Yet harder knapsack problems (Q653327) (← 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)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems (Q1333241) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity (Q4427368) (← links)
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers (Q4922900) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)