A 2 ×30k-Spin Multichip Scalable Annealing Processor Based on a Processing-In-Memory Approach for Solving Large-Scale Combinatorial Optimization Problems.
Takashi TakemotoMasato HayashiChihiro YoshimuraMasanao YamaokaPublished in: ISSCC (2019)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- discrete optimization
- continuous optimization problems
- simulated annealing
- processing elements
- memory management
- metaheuristic
- optimization problems
- knapsack problem
- ant colony optimization
- job shop scheduling
- web scale
- traveling salesman problem
- high speed
- random access
- branch and bound
- computational power
- vehicle routing problem
- shortest path problem
- operating system
- min cost
- job shop scheduling problem
- neural network
- intel xeon
- exact algorithms
- branch and bound algorithm
- parallel processing
- main memory
- heuristic search
- special case
- search space
- general purpose processors
- genetic algorithm