An accelerated procedure for solving binary optimization problems
From MaRDI portal
Publication:404203
DOI10.1134/S1064230709050074zbMATH Open1294.90043MaRDI QIDQ404203FDOQ404203
Authors: B. V. Kryzhanovskii, V. M. Kryzhanovskii 
Publication date: 4 September 2014
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- Hopfield neural networks for optimization: Study of the different dynamics
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Neural networks and physical systems with emergent collective computational abilities
- New Optimization Algorithms in Physics
- Regularization algorithms for learning that are equivalent to multilayer networks
- ``Neural computation of decisions in optimization problems
Cited In (6)
- Increasing the attraction area of the global minimum in the binary optimization problem
- Accelerating optimization by tracing valley
- Transformation of energy landscape in the problem of binary minimization
- Discretization of a matrix in quadratic functional binary optimization
- Application of the clipping procedure to the binary minimization of a quadratic functional
- Title not available (Why is that?)
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)
