Abstract
Branch-and-bound for integer optimization typically uses single-variable disjunctions. Enumerative methods for integer optimization with theoretical guarantees use a non-binary search tree with general disjunctions based on lattice structure. These disjunctions are expensive to compute and challenging to implement. Here we compare two lattice reformulations that can be used to heuristically obtain general disjunctions in the original space, we develop a new lattice-based variant, and compare the derived disjunctions computationally with those produced by the algorithm of Lovász and Scarf.
Original language | English |
---|---|
Pages (from-to) | 401-407 |
Number of pages | 7 |
Journal | Operations Research Letters |
Volume | 51 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2023 |
Keywords
- Branching on general disjunctions
- Integer optimization
- Lattice-based reformulation