Solving combinatorial optimisation problems using oscillator based Ising machines

DOI10.1007/s11047-021-09845-3zbMath1530.68119OpenAlexW3163224880MaRDI QIDQ6095496

Parth Nobel, Jaijeet Roychowdhury, Tianshi Wang, Leon Wu

Publication date: 8 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-021-09845-3

zbMATH Keywords

Lyapunov functionHamiltoniangraph colouringMAX-CUToscillatorsCMOSIsing machinesfrustrated loops

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Coloring of graphs and hypergraphs (05C15) Other nonclassical models of computation (68Q09)

Cites Work

• ``Neural computation of decisions in optimization problems
• OIM: oscillator-based Ising machines for solving combinatorial optimisation problems
• Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
• Advanced Scatter Search for the Max-Cut Problem
• Randomized heuristics for the Max-Cut problem
• A Spectral Bundle Method for Semidefinite Programming
• Reducibility among Combinatorial Problems
• Beitrag zur Theorie des Ferromagnetismus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving combinatorial optimisation problems using oscillator based Ising machines