USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization Problems.
Guangmo TongPublished in: NeurIPS (2021)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- discrete optimization
- continuous optimization problems
- metaheuristic
- optimization problems
- knapsack problem
- ant colony optimization
- traveling salesman problem
- job shop scheduling
- shortest path problem
- branch and bound algorithm
- simulated annealing
- min cost
- job shop scheduling problem
- branch and bound
- jigsaw puzzle
- optimal solution
- sat solving
- vehicle routing problem
- search strategy
- upper bound
- estimation of distribution algorithms
- single machine scheduling problem
- exact algorithms
- quadratic assignment problem
- aco algorithms
- np hard
- objective function
- weighted max sat