Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon
computability of global solutions to factorable nonconvex programs : part i - convex underestimating problems .