Branching via Cutting Plane Selection: Improving Hybrid Branching - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

Branching via Cutting Plane Selection: Improving Hybrid Branching

Résumé

Cutting planes and branching are two of the most important algorithms for solving mixed-integer linear programs. For both algorithms, disjunctions play an important role, being used both as branching candidates and as the foundation for some cutting planes. We relate branching decisions and cutting planes to each other through the underlying disjunctions that they are based on, with a focus on Gomory mixed-integer cuts and their corresponding split disjunctions. We show that selecting branching decisions based on quality measures of Gomory mixed-integer cuts leads to relatively small branch-and-bound trees, and that the result improves when using cuts that more accurately represent the branching decisions. Finally, we show how the history of previously computed Gomory mixed-integer cuts can be used to improve the performance of the state-of-the-art hybrid branching rule of SCIP. Our results show a 4% decrease in solve time, and an 8% decrease in number of nodes over affected instances of MIPLIB 2017.

Dates et versions

hal-04431308 , version 1 (01-02-2024)

Licence

Paternité

Identifiants

Citer

Mark Turner, Timo Berthold, Mathieu Besançon, Thorsten Koch. Branching via Cutting Plane Selection: Improving Hybrid Branching. 2024. ⟨hal-04431308⟩
6 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More