A study of lattice reformulations for integer programming |
| |
Institution: | 1. Technische Universiteit Delft, Mekelweg 4, 2628 CD Delft, the Netherlands;2. CORE, UCLouvain, 34 voie du Roman Pays, 1348 Louvain-la-Neuve, Belgium |
| |
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. |
| |
Keywords: | Integer optimization Lattice-based reformulation Branching on general disjunctions |
本文献已被 ScienceDirect 等数据库收录! |
|