Mean field approximation for solving QUBO problems

The Quadratic Unconstrained Binary Optimization (QUBO) problem is NP-hard. Some exact methods like the Branch-and-Bound algorithm are suitable for small problems. Some approximations like stochastic simulated annealing for discrete variables or mean-field annealing for continuous variables exist for...

Descripción completa

Detalles Bibliográficos
Autores principales: Veszeli, Máté Tibor, Vattay, Gábor
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2022
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9427122/
https://www.ncbi.nlm.nih.gov/pubmed/36041120
http://dx.doi.org/10.1371/journal.pone.0273709

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9427122/
https://www.ncbi.nlm.nih.gov/pubmed/36041120
http://dx.doi.org/10.1371/journal.pone.0273709

Ejemplares similares