Learning to Cover Locally: Graph Neural Combinatorial Optimization under a Hard Information Horizon

Johannes F. Loevenich, Thies Moehlenhof, Laurin Holz +3

Neural combinatorial optimization typically assumes a centralized solver that reads the whole instance. We study the opposite: combinatorial optimization under a hard information h…