Exact Combinatorial Optimization with Graph Convolutional Neural Networks
Maxime Gasse, Didier Chetelat, Nicola Ferroni, Laurent Charlin, Andrea Lodi
–Neural Information Processing Systems
In practice, most combinatorial optimization problems can be formulated as mixed-integer linear programs (MILPs), in which case branch-and-bound (B&B) [35] is the exact method of choice.
Neural Information Processing Systems
Feb-14-2026, 07:09:09 GMT
- Country:
- Technology: