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...

Descripción completa

Detalles Bibliográficos
Autores principales: Cen, Yunuo, Das, Debasis, Fong, Xuanyao
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9427840/
https://www.ncbi.nlm.nih.gov/pubmed/36042250
http://dx.doi.org/10.1038/s41598-022-19102-x

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9427840/
https://www.ncbi.nlm.nih.gov/pubmed/36042250
http://dx.doi.org/10.1038/s41598-022-19102-x

Ejemplares similares