Pages that link to "Item:Q2149550"
From MaRDI portal
The following pages link to Complexity of linear relaxations in integer programming (Q2149550):
Displaying 5 items.
- On the path-width of integer linear programming (Q515665) (← links)
- Nearness and bound relationships between an integer-programming problem and its relaxed linear-programming problem (Q1265040) (← links)
- On the complexity of linear programming in the BSS-model (Q1302143) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)