Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
From MaRDI portal
Publication:4633149
DOI10.1126/sciadv.aav2372zbMath1411.90295OpenAlexW2938847643WikidataQ64101291 ScholiaQ64101291MaRDI QIDQ4633149
Hayato Goto, Kosuke Tatsumura, Alexander R. Dixon
Publication date: 2 May 2019
Published in: Science Advances (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1126/sciadv.aav2372
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)
Related Items (8)
QUBO Software ⋮ On computational capabilities of Ising machines based on nonlinear oscillators ⋮ Modeling the Costas array problem in QUBO for quantum annealing ⋮ Synthetic nonlinear second-order oscillators on Riemannian manifolds and their numerical simulation ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ Mathematical aspects of the Digital Annealer's simulated annealing algorithm ⋮ Dynamical Systems Theory and Algorithms for NP-hard Problems ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods
This page was built for publication: Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
