Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation.
Haoyu WangNan WuHang YangCong HaoPan LiPublished in: NeurIPS (2022)
Keyphrases
- combinatorial optimization
- unsupervised learning
- combinatorial optimization problems
- metaheuristic
- branch and bound
- simulated annealing
- branch and bound algorithm
- mathematical programming
- traveling salesman problem
- supervised learning
- optimization problems
- hard combinatorial optimization problems
- combinatorial problems
- semi supervised
- quadratic assignment problem
- lagrangian relaxation
- exact algorithms
- ant colony optimization
- model selection
- evolutionary algorithm
- vehicle routing problem
- single machine scheduling problem
- machine learning
- dimensionality reduction
- search algorithm
- objective function
- convex relaxation
- combinatorial search