Recursively applying large neighborhood search to its own auxiliary MILPs, guided by a graph transformer, finds good solutions faster than one-layer LNS and standard solvers on four large MILP benchmarks.
Mathematical Programming Computation 6, 33–54 (2014) 16 W
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Mixed-Integer Linear Optimization via Learning-Based Two-Layer Large Neighborhood Search
Recursively applying large neighborhood search to its own auxiliary MILPs, guided by a graph transformer, finds good solutions faster than one-layer LNS and standard solvers on four large MILP benchmarks.