awesome-ml4co
Awesome machine learning for combinatorial optimization papers.
What is awesome-ml4co?
Awesome machine learning for combinatorial optimization papers.
Overview of awesome-ml4co
What it is
This is a curated list of academic papers that apply machine learning techniques to combinatorial optimization problems. Maintained by members of SJTU-Thinklab, the repository organizes resources by problem type and includes survey papers, benchmark results (beta), and contributions marked with a star.
Key features
- Contains 20 survey papers covering decades of research on neural networks, reinforcement learning, and graph neural networks for combinatorial optimization.
- Papers are grouped by 36 specific problem categories, including Travelling Salesman Problem (TSP), Vehicle Routing Problem (VRP), Graph Matching, Mixed Integer Programming, and many others.
- Includes a beta benchmark section for TSP with performance charts generated from a CSV file.
- Contributions from the Thinklab group are marked with a star for easy identification.
- The list is actively maintained and welcomes community contributions.
Use cases
- Researchers looking for a comprehensive overview of machine learning methods for combinatorial optimization.
- Practitioners seeking state-of-the-art references for specific problems such as TSP, VRP, or job shop scheduling.
- Students and educators compiling reading lists or literature reviews on neural combinatorial optimization.
Getting started
See the repository README for the full list of papers and organization. No installation or code execution is required.
License and pricing
The license is not stated in the repository metadata. The project is marked as open source (pricing_type: open_source).
Based on the project's public README and repository metadata.