Author: @Gemini Light Last Update:
12/26/2021
This is a brief survey on machine learning for combinatorial optimization, a fascinating and significant topic. We mainly collect relevant papers from top conferences, classify them into several categories by method types, and indicate additional information.
It's inevitable to have omissions or errors during the discussion for the limitation of the author's knowledge. Welcome to feedback them you found.
- TSP: Travelling Salesman Problem
- VRP: Vehicular Routing Problem
- MAXCUT: Maximum Cut
- MVC: Minimum Vertex Cover
- MIS: Maximal Independent Set
- MC: Maximal Clique
- MCP: Maximum Coverage Problem
- SAT: Satisfiability
- GC: Graph Coloring
- JSSP: Job Shop Scheduling Problem
- 3D-BPP: 3D Bin-Packing Problem
- MIP/MILP: Mixed Integer (Linear) Programming
- ......
- SL: Supervised Learning
- UL: Unsupervised Learning
- RL: Reinforcement Learning (Including Imitation Learning, IL)
- RNN: Recurrent Neural Network (Including LSTM, GRU)
- CNN: Convolutional Neural Network
- GNN: Graph Neural Network (Including Graph Embedding, GE)
- Attention (Including Self-Attention)
- Transformer
......