Corpus ID: 220871133

Branch-and-Bound Solves Random Binary Packing IPs in Polytime

@article{Dey2020BranchandBoundSR,
  title={Branch-and-Bound Solves Random Binary Packing IPs in Polytime},
  author={Santanu S. Dey and Y. Dubey and M. Molinaro},
  journal={ArXiv},
  year={2020},
  volume={abs/2007.15192}
}
Branch-and-bound is the workhorse of all state-of-the-art mixed integer linear programming (MILP) solvers. These implementations of branch-and-bound typically use variable branching, that is, the child nodes are obtained by fixing some variable to an integer value v in one node and to v + 1 in the other node. Even though modern MILP solvers are able to solve very large-scale instances efficiently, relatively little attention has been given to understanding why the underlying branch-and-bound… Expand
2 Citations
On the Integrality Gap of Binary Integer Programs with Gaussian Data
  • 1
  • Highly Influenced
  • PDF

References

SHOWING 1-10 OF 39 REFERENCES
Basis reduction and the complexity of branch-and-bound
  • 26
  • Highly Influential
  • PDF
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
  • 31
Where are the hard knapsack problems?
  • 356
  • PDF
The Geometry of Online Packing Linear Programs
  • 45
  • PDF
Probabilistic analysis of knapsack core algorithms
  • 22
  • PDF
Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
  • 22
  • PDF
Approximating polyhedra with sparse inequalities
  • 24
  • PDF
A Computational Study of Search Strategies for Mixed Integer Programming
  • 336
  • PDF
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances
  • 50
  • PDF
Random knapsack in expected polynomial time
  • 118
  • PDF
...
1
2
3
4
...