Branch and Bound Algorithms-Principles and Examples

By J. Clausen. 2003

371 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Real-time loop closure in 2D LIDAR SLAM (2016, background): “Literature on the topic is extensive; see [18] for a short overview.”
Neural-Guided Deductive Search for Real-Time Program Synthesis from Examples (2018, methodology): “It is based on the “branch & bound” technique from combinatorial optimization (Clausen, 1999).”
Structured Learning and Prediction in Computer Vision (2011, background): “A more extensive discussion of branch-and-bound methods can be found in [32, 168].”
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning (2016, unknown): “Clausen [6] gives an overview of these different components and how they affect algorithm performance for the Traveling Salesman Problem, the Graph Partitioning Problem, and the Quadratic Assignment Problem.”
Systems Optimizations for Learning Certifiably Optimal Rule Lists (2018, background): “Other elds solve similar computationally hard combinatorial problems through the use of branch-and-bound algorithms[5].”