Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More.
Fanchen BuHyeonsoo JoSoo Yong LeeSungsoo AhnKijung ShinPublished in: CoRR (2024)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- combinatorial optimization problems
- branch and bound
- metaheuristic
- simulated annealing
- optimization problems
- combinatorial problems
- branch and bound algorithm
- exact algorithms
- graph theory
- sufficient conditions
- quadratic assignment problem
- unsupervised learning
- path relinking
- hard combinatorial optimization problems
- max flow min cut
- job shop scheduling problem
- mathematical programming
- supervised learning
- minimum cost
- vehicle routing problem
- global minimum
- semi supervised
- scheduling problem
- search space
- multiscale