An accelerated procedure for solving binary optimization problems
From MaRDI portal
Recommendations
- Transformation of energy landscape in the problem of binary minimization
- Discretization of a matrix in quadratic functional binary optimization
- Increasing the attraction area of the global minimum in the binary optimization problem
- Quadratic reformulations of nonlinear binary optimization problems
- Application of the clipping procedure to the binary minimization of a quadratic functional
Cites work
- ``Neural computation of decisions in optimization problems
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- Hopfield neural networks for optimization: Study of the different dynamics
- scientific article; zbMATH DE number 1735139 (Why is no real title available?)
- scientific article; zbMATH DE number 861619 (Why is no real title available?)
- Neural networks and physical systems with emergent collective computational abilities
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- New Optimization Algorithms in Physics
- Regularization algorithms for learning that are equivalent to multilayer networks
Cited in
(7)- Accelerating optimization by tracing valley
- Dual mean field annealing scheme for binary optimization under linear constraints
- Increasing the attraction area of the global minimum in the binary optimization problem
- scientific article; zbMATH DE number 3970524 (Why is no real title available?)
- Discretization of a matrix in quadratic functional binary optimization
- Transformation of energy landscape in the problem of binary minimization
- Application of the clipping procedure to the binary minimization of a quadratic functional
This page was built for publication: An accelerated procedure for solving binary optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404203)
