Pages that link to "Item:Q2581317"
From MaRDI portal
The following pages link to Simple lifted cover inequalities and hard knapsack problems (Q2581317):
Displaying 6 items.
- Yet harder knapsack problems (Q653327) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)
