Learning MILP resolution outcomes before reaching time-limit

DOI10.1007/978-3-030-19212-9_18OpenAlexW2945160244MaRDI QIDQ2327258

Andrea Lodi, Giulia Zarpellon, Martina Fischetti

Publication date: 14 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-19212-9_18

zbMATH Keywords

branch and boundmachine learningMILP resolution

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Estimating the Size of Branch-and-Bound Trees ⋮ Optimization problems for machine learning: a survey ⋮ On the optimized design of next-generation wind farms ⋮ Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems

This page was built for publication: Learning MILP resolution outcomes before reaching time-limit