A tree search algorithm towards solving Ising formulated combinatorial optimization problems
Simulated annealing (SA) attracts more attention among classical heuristic algorithms because many combinatorial optimization problems can be easily recast as the ground state search problem of the Ising Hamiltonian. However, for practical implementation, the annealing process cannot be arbitrarily...
Saved in:
| Published in: | Scientific reports Vol. 12; no. 1; pp. 14755 - 12 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
London
Nature Publishing Group UK
30.08.2022
Nature Publishing Group Nature Portfolio |
| Subjects: | |
| ISSN: | 2045-2322, 2045-2322 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!