Filtern
Erscheinungsjahr
- 2017 (2) (entfernen)
Dokumenttyp
- Masterarbeit (1)
- ZIB-Report (1)
Sprache
- Englisch (2)
Gehört zur Bibliographie
- nein (2)
Schlagworte
- branch-and-bound (1)
- branching rule (1)
- mixed-integer programming (1)
- strong branching (1)
Institut
Branching rules are an integral component of the branch-and-bound algorithm typically used to solve mixed-integer programs and subject to intense research. Different approaches for branching are typically compared based on the solving time as well as the size of the branch-and-bound tree needed to prove optimality. The latter, however, has some flaws when it comes to sophisticated branching rules that do not only try to take a good branching decision, but have additional side-effects. We propose a new measure for the quality of a branching rule that distinguishes tree size reductions obtained by better branching decisions from those obtained by such side-effects. It is evaluated for common branching rules providing new insights in the importance of strong branching.