Digital Annealer for High-Speed Solving of Combinatorial optimization Problems and Its Applications.
Satoshi MatsubaraMotomu TakatsuToshiyuki MiyazawaTakayuki ShibasakiYasuhiro WatanabeKazuya TakemotoHirotaka TamuraPublished in: ASP-DAC (2020)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- high speed
- discrete optimization
- continuous optimization problems
- optimization problems
- knapsack problem
- metaheuristic
- traveling salesman problem
- shortest path problem
- ant colony optimization
- job shop scheduling
- job shop scheduling problem
- exact algorithms
- simulated annealing
- real time
- vehicle routing problem
- low power
- min cost
- lower bound
- linear programming
- evolutionary algorithm
- scheduling problem
- multiple objectives
- worst case
- branch and bound algorithm
- constraint satisfaction