Cargando…
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...
Autores principales: | Veszeli, Máté Tibor, Vattay, Gábor |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2022
|
Materias: | |
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 |
Ejemplares similares
-
Relaxation of the Ising spin system coupled to a bosonic bath and the time dependent mean field equation
por: Veszeli, Máté Tibor, et al.
Publicado: (2022) -
A Landauer Formula for Bioelectronic Applications
por: Papp, Eszter, et al.
Publicado: (2019) -
HUBO and QUBO models for prime factorization
por: Jun, Kyungtaek, et al.
Publicado: (2023) -
A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers
por: Cruz-Santos, William, et al.
Publicado: (2018) -
Distance-based clustering using QUBO formulations
por: Matsumoto, Nasa, et al.
Publicado: (2022)