Pages that link to "Item:Q896270"
From MaRDI portal
The following pages link to Lower bounds on the sizes of integer programs without additional variables (Q896270):
Displaying 9 items.
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Computational aspects of relaxation complexity (Q2061898) (← links)
- Complexity of linear relaxations in integer programming (Q2149550) (← links)
- Sparsity of integer formulations for binary programs (Q2294334) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)
- The role of rationality in integer-programming relaxations (Q6126664) (← links)
