Pages that link to "Item:Q2661530"
From MaRDI portal
The following pages link to Polynomial size IP formulations of knapsack may require exponentially large coefficients (Q2661530):
Displaying 5 items.
- Computational aspects of relaxation complexity (Q2061898) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)
