Non-binary dynamical Ising machines for combinatorial optimization
From MaRDI portal
Cites work
- A graph coloring algorithm for large scheduling problems
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- Chessboard graphs, related designs, and domination parameters
- Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Neurons with graded response have collective computational properties like those of two-state neurons
- On computational capabilities of Ising machines based on nonlinear oscillators
- Optimization by simulated annealing
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Reducibility among combinatorial problems
- The many formulae for the number of Latin rectangles
- The quadratic unconstrained binary optimization problem. Theory, algorithms, and applications
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
This page was built for publication: Non-binary dynamical Ising machines for combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6867210)