A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming
From MaRDI portal
Publication:6426161
arXiv2302.05636MaRDI QIDQ6426161FDOQ6426161
Authors: Qingyu Han, Linxin Yang, Qian Chen, Xiang Zhou, Dong Zhang, Akang Wang, Ruoyu Sun, X. Luo 
Publication date: 11 February 2023
Abstract: Mixed-integer linear programming (MILP) is widely employed for modeling combinatorial optimization problems. In practice, similar MILP instances with only coefficient variations are routinely solved, and machine learning (ML) algorithms are capable of capturing common patterns across these MILP instances. In this work, we combine ML with optimization and propose a novel predict-and-search framework for efficiently identifying high-quality feasible solutions. Specifically, we first utilize graph neural networks to predict the marginal probability of each variable, and then search for the best feasible solution within a properly defined ball around the predicted solution. We conduct extensive experiments on public datasets, and computational results demonstrate that our proposed framework achieves 51.1% and 9.9% performance improvements to MILP solvers SCIP and Gurobi on primal gaps, respectively.
Has companion code repository: https://github.com/sribdcn/Predict-and-Search_MILP_method
This page was built for publication: A GNN-Guided Predict-and-Search Framework for Mixed-Integer Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6426161)
