DOE OSTI · 21049451
SMMH--A Parallel Heuristic for Combinatorial Optimization Problems
Abstract
The process of finding one or more optimal solutions for answering combinatorial optimization problems bases itself on the use of algorithms instances. Those instances usually have to explore a very large search spaces. Heuristics search focusing on the use of High-Order Hopfield neural networks is a largely deployed technique for very large search space. It can be established a very powerful analogy towards the dynamics evolution of a physics spin-glass system while minimizing its own energy and the energy function of the network. This paper presents a new approach for solving combinatorial optimization problems through parallel simulations, based on a High-Order Hopfield neural network using MPI specification.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Domingues, Guilherme, Morie, Yoshiyuki, Gu, Feng Long, Nanri, Takeshi, Murakami, Kazuaki. 2007-12-26. SMMH--A Parallel Heuristic for Combinatorial Optimization Problems. https://doi.org/10.1063/1.2836099. https://searchnasa.com/record/osti%3A21049451/smmh-a-parallel-heuristic-for-combinatorial-optimization-problems
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.