A large number of real-world optimization problems can be formulated as Mixed Integer Linear Programs (MILP). MILP solvers expose numerous configuration parameters to control their internal algorithms. Solutions, and their associated costs or runtimes, are significantly affected by the choice of the configuration parameters, even when problem instances have the same number of decision variables and constraints. On one hand, using the default solver configuration leads to suboptimal solutions. On the other hand, searching and evaluating a large number of configurations for every problem instance is time-consuming and, in some cases, infeasible. In this study, we aim to predict configuration parameters for unseen problem instances that yield lower-cost solutions without the time overhead of searching-and-evaluating configurations at the solving time. Toward that goal, we first investigate the cost correlation of MILP problem instances that come from the same distribution when solved using different configurations. We show that instances that have similar costs using one solver configuration also have similar costs using another solver configuration in the same runtime environment. After that, we present a methodology based on Deep Metric Learning to learn MILP similarities that correlate with their final solutions' costs. At inference time, given a new problem instance, it is first projected into the learned metric space using the trained model, and configuration parameters are instantly predicted using previously-explored configurations from the nearest neighbor instance in the learned embedding space. Empirical results on real-world problem benchmarks show that our method predicts configuration parameters that improve solutions' costs by up to 38% compared to existing approaches.
A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability
University of Science and Technology of China(中国科学技术大学);Noah’s Ark Lab, Huawei(华为诺亚方舟实验室);Institute of Artificial Intelligence, Hefei Comprehensive National Science Center(合肥综合性国家科学中心人工智能研究院)
MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers
University of Toronto(多伦多大学);Mila – Quebec AI Institute(Mila-魁北克人工智能研究所);McGill University(麦吉尔大学);RWTH Aachen University(亚琛工业大学);Jacobs Technion-Cornell Institute(雅各布斯特里昂-康奈尔研究所);Cornell Tech(康奈尔理工学院);Technion – IIT(以色列理工学院)
Promoting Generalization for Exact Solvers via Adversarial Instance Augmentation
CAS Key Laboratory of Technology in GIPAS, University of Science and Technology of China(GIPAS技术CAS重点实验室,中国科学技术大学);Institute of Artificial Intelligence, Hefei Comprehensive National Science Center(合肥综合性国家科学中心人工智能研究院)
RoME: Domain-Robust Mixture-of-Experts for MILP Solution Prediction across Domains
Laboratory for Big Data and Decision, College of Systems Engineering, National University of Defense Technology(大数据与决策实验室,系统工程学院,国防科技大学);MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition, University of Science and Technology of China(脑启发智能感知与认知关键实验室,中国科学技术大学);College of Computer Science and Technology, National University of Defense Technology(计算机科学与技术学院,国防科技大学)
University of Oxford(牛津大学);The Alan Turing Institute(艾伦·图灵研究所);Mila, Polytechnique Montréal(蒙特利尔综合理工学院Mila);University of Toronto(多伦多大学);CERC, Polytechnique Montréal(蒙特利尔综合理工学院CERC);Mila, Université de Montréal(蒙特利尔大学Mila)
Deep graph matching meets mixed-integer linear programming: Relax at your own risk ?
Guilin University of Electronic Technology(桂林电子科技大学);Université de Tours(图尔大学);Laboratoire d’Informatique Fondamentale et Appliquée de Tours (LIFAT - EA 6300)(图尔基础与应用计算机实验室(LIFAT - EA 6300))
Department of Computer Science(计算机科学系);Department of Computer Science and Engineering(计算机科学与工程系);Virginia Tech(弗吉尼亚理工学院);Mississippi State University(密苏里州立大学);Emory University(埃默里大学)