SMMH - A parallel heuristic for combinatorial optimization problems

Guilherme Domingues, Yoshiyuki Morie, Feng Long Gu, Takeshi Nanri, Kazuaki Murakami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationComputation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)
Pages1195-1198
Number of pages4
Edition2
DOIs
Publication statusPublished - Dec 1 2007
EventInternational Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007 - Corfu, Greece
Duration: Sep 25 2007Sep 30 2007

Publication series

NameAIP Conference Proceedings
Number2
Volume963
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Other

OtherInternational Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007
CountryGreece
CityCorfu
Period9/25/079/30/07

Fingerprint

optimization
spin glass
specifications
physics
energy
simulation

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Cite this

Domingues, G., Morie, Y., Gu, F. L., Nanri, T., & Murakami, K. (2007). SMMH - A parallel heuristic for combinatorial optimization problems. In Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007) (2 ed., pp. 1195-1198). (AIP Conference Proceedings; Vol. 963, No. 2). https://doi.org/10.1063/1.2835960

SMMH - A parallel heuristic for combinatorial optimization problems. / Domingues, Guilherme; Morie, Yoshiyuki; Gu, Feng Long; Nanri, Takeshi; Murakami, Kazuaki.

Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007). 2. ed. 2007. p. 1195-1198 (AIP Conference Proceedings; Vol. 963, No. 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Domingues, G, Morie, Y, Gu, FL, Nanri, T & Murakami, K 2007, SMMH - A parallel heuristic for combinatorial optimization problems. in Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007). 2 edn, AIP Conference Proceedings, no. 2, vol. 963, pp. 1195-1198, International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007, Corfu, Greece, 9/25/07. https://doi.org/10.1063/1.2835960
Domingues G, Morie Y, Gu FL, Nanri T, Murakami K. SMMH - A parallel heuristic for combinatorial optimization problems. In Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007). 2 ed. 2007. p. 1195-1198. (AIP Conference Proceedings; 2). https://doi.org/10.1063/1.2835960
Domingues, Guilherme ; Morie, Yoshiyuki ; Gu, Feng Long ; Nanri, Takeshi ; Murakami, Kazuaki. / SMMH - A parallel heuristic for combinatorial optimization problems. Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007). 2. ed. 2007. pp. 1195-1198 (AIP Conference Proceedings; 2).
@inproceedings{155a2d3b2277484e912ec4ca8b8ff633,
title = "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.",
author = "Guilherme Domingues and Yoshiyuki Morie and Gu, {Feng Long} and Takeshi Nanri and Kazuaki Murakami",
year = "2007",
month = "12",
day = "1",
doi = "10.1063/1.2835960",
language = "English",
isbn = "9780735404786",
series = "AIP Conference Proceedings",
number = "2",
pages = "1195--1198",
booktitle = "Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)",
edition = "2",

}

TY - GEN

T1 - SMMH - A parallel heuristic for combinatorial optimization problems

AU - Domingues, Guilherme

AU - Morie, Yoshiyuki

AU - Gu, Feng Long

AU - Nanri, Takeshi

AU - Murakami, Kazuaki

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71449115250&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71449115250&partnerID=8YFLogxK

U2 - 10.1063/1.2835960

DO - 10.1063/1.2835960

M3 - Conference contribution

AN - SCOPUS:71449115250

SN - 9780735404786

T3 - AIP Conference Proceedings

SP - 1195

EP - 1198

BT - Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)

ER -