Cargando…
Solving large break minimization problems in a mirrored double round-robin tournament using quantum annealing
Quantum annealing has gained considerable attention because it can be applied to combinatorial optimization problems, which have numerous applications in logistics, scheduling, and finance. In recent years, with the technical development of quantum annealers, research on solving practical combinator...
Autores principales: | Kuramata, Michiya, Katsuki, Ryota, Nakata, Kazuhide |
---|---|
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/PMC8993026/ https://www.ncbi.nlm.nih.gov/pubmed/35395057 http://dx.doi.org/10.1371/journal.pone.0266846 |
Ejemplares similares
-
Genetic algorithm with a new round-robin based tournament selection: Statistical properties analysis
por: Hussain, Abid, et al.
Publicado: (2022) -
Breaking limitation of quantum annealer in solving optimization problems under constraints
por: Ohzeki, Masayuki
Publicado: (2020) -
Solving problems with quantum annealing
por: Thom, Murray
Publicado: (2021) -
Solving Set Cover with Pairs Problem using Quantum Annealing
por: Cao, Yudong, et al.
Publicado: (2016) -
New Hybrid Quantum Annealing Algorithms for Solving Vehicle Routing Problem
por: Borowski, Michał, et al.
Publicado: (2020)