Goto

Collaborating Authors

 subroutine











AGeneralLargeNeighborhoodSearchFramework forSolvingIntegerLinearPrograms

Neural Information Processing Systems

We focus on solving integer linear programs, and ground our approach in the large neighborhood search (LNS) paradigm, which iteratively chooses a subset of variables to optimize while leaving the remainder fixed. The appeal of LNS is that it can easily use any existing solver as a subroutine, and thus can inherit the benefits of carefully engineered heuristic or complete approaches and their software implementations.