The following pages link to (Q5417704):
Displaying 9 items.
- Theoretical complexity of grid cover problems used in radar applications (Q1626552) (← links)
- Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- (Q5092485) (← links)
- On the integrality gap of binary integer programs with Gaussian data (Q5925655) (← links)
- Branch-and-bound solves random binary IPs in poly\((n)\)-time (Q6041109) (← links)