A Ferroelectric Compute-in-Memory Annealer for Combinatorial Optimization Problems.
Xunzhao YinYu QianAlptekin VardarMarcel GuntherFranz MüllerNellie LaleniZijian ZhaoZhouhang JiangZhiguo ShiYiyu ShiXiao GongCheng ZhuoThomas KämpfeKai NiPublished in: CoRR (2023)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- optimization problems
- knapsack problem
- discrete optimization
- ant colony optimization
- metaheuristic
- continuous optimization problems
- job shop scheduling
- shortest path problem
- traveling salesman problem
- vehicle routing problem
- job shop scheduling problem
- memory usage
- information retrieval
- min cost
- memetic algorithm
- branch and bound
- upper bound
- exact algorithms
- neural network
- minmax regret
- benchmark problems
- memory requirements
- special case
- evolutionary algorithm
- data structure