Python
2,177 stars
Awesome machine learning for combinatorial optimization papers.
### Overview:
This repository is an initiative to compile and catalog resources that utilize machine learning techniques to address combinatorial optimization problems. Contributions are marked by the Thinklab team, and the project aims to provide a comprehensive overview of various algorithms and methods used in this field.
### Key Features:
- **Survey Papers**: Comprehensive reviews of machine learning approaches to combinatorial optimization.
- **Problems**: Detailed breakdowns of common combinatorial optimization problems such as the Travelling Salesman Problem (TSP), Job Shop Scheduling Problem (JSSP), Flow Shop Problem (FSP), Sorting & Ranking (Sort&Rank), Graph Matching (GM), Quadratic Assignment Problem (QAP), Portfolio Optimization (PortOpt), Maximal Cut, Vehicle Routing Problem (VRP), Maximum Independent Set, Generalization, Orienteering Problem (OP), Knapsack, Boolean Satisfiability (SAT), Computing Resource Allocation, Bin Packing Problem (BPP), Graph Edit Distance (GED), Hamiltonian Cycle Problem (HCP), Graph Coloring, Maximal Common Subgraph (MCS), Influence Maximization, Max Clique, Mixed Integer Programming (MIP), Causal Discovery, Differentiable Optimization, Car Dispatch, Electronic Design Automation (EDA), Conjunctive Query Containment, Virtual Network Embedding (VNE), Predict+Optimize, Optimal Power Flow, Facility Location Problem (FLP), and Combinatorial Drug Recommendation.
### Tech Stack:
Python
### Why It Matters:
This repository serves as a valuable resource for researchers, practitioners, and students interested in machine learning applications