Concepedia

Concept

branch and bound

Parents

611

Publications

47.9K

Citations

1.1K

Authors

530

Institutions

About

Branch and bound is a general algorithmic methodology for finding optimal solutions to discrete, integer, and combinatorial optimization problems. It operates by systematically exploring the solution space through recursive partitioning (branching), while utilizing computed lower and upper bounds on the objective function for subproblems (bounding) to eliminate (prune) branches that cannot yield a solution superior to the best one found thus far, thereby guaranteeing optimality. This technique is significant for its ability to solve complex problems by exploring only a subset of the potential solutions.

Top Authors

Rankings shown are based on concept H-Index.

PT

University of Bologna

GL

HEC Montréal

GL

Georgia Institute of Technology

TI

Kyoto University

NM

Centre National de la Recherche Scientifique

Top Institutions

Rankings shown are based on concept H-Index.

Georgia Institute of Technology

Atlanta, United States

Purdue University West Lafayette

West Lafayette, United States

Pittsburgh, United States

HEC Montréal

Montreal, Canada