no code implementations • NeurIPS 2014 • He He, Hal Daume III, Jason M. Eisner
Branch-and-bound is a widely used method in combinatorial optimization, including mixed integer programming, structured prediction and MAP inference.
Combinatorial Optimization Imitation Learning +1