The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Abstract
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolation, ignoring that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning as a new approach for solving combinatorial problems, either directly as solvers or by enhancing exact solvers. Based on this context, the ML4CO aims at improving state-of-the-art combinatorial optimization solvers by replacing key heuristic components. The competition featured three challenging tasks: finding the best feasible solution, producing the tightest optimality certificate, and giving an appropriate solver configuration. Three realistic datasets were considered: balanced item placement, workload apportionment, and maritime inventory routing. This last dataset was kept anonymous for the contestants.
Cite
@article{arxiv.2203.02433,
title = {The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights},
author = {Maxime Gasse and Quentin Cappart and Jonas Charfreitag and Laurent Charlin and Didier Chételat and Antonia Chmiela and Justin Dumouchelle and Ambros Gleixner and Aleksandr M. Kazachkov and Elias Khalil and Pawel Lichocki and Andrea Lodi and Miles Lubin and Chris J. Maddison and Christopher Morris and Dimitri J. Papageorgiou and Augustin Parjadis and Sebastian Pokutta and Antoine Prouvost and Lara Scavuzzo and Giulia Zarpellon and Linxin Yang and Sha Lai and Akang Wang and Xiaodong Luo and Xiang Zhou and Haohan Huang and Shengcheng Shao and Yuanming Zhu and Dong Zhang and Tao Quan and Zixuan Cao and Yang Xu and Zhewei Huang and Shuchang Zhou and Chen Binbin and He Minggui and Hao Hao and Zhang Zhiyu and An Zhiwu and Mao Kun},
journal= {arXiv preprint arXiv:2203.02433},
year = {2022}
}
Comments
Neurips 2021 competition. arXiv admin note: text overlap with arXiv:2112.12251 by other authors