Neural Certificate Pricing for Combinatorial Optimization Problems

Combinatorial optimization (CO) problems are difficult because certifiable discrete structure induces exponential search.

Combinatorial optimization (CO) problems are difficult because certifiable discrete structure induces exponential search. One needs to search over the set exponentially many candidates to certify optimality, however, the structural feasibility of a path, packing, or cover can be…