The following pages link to (Q4737524):
Displayed 6 items.
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)