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}
}

• Santanu S. Dey, Y. Dubey, M. Molinaro
• Published 2020
• Mathematics, Computer Science
• ArXiv

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

optimization-online.org

Save to Library

Create Alert

Cite

Launch Research Feed