SMMH - A parallel Heuristic for combinatorial optimization problems

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

doi:10.1063/1.2836099

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 proceeding › Conference 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 language	English
Title of host publication	Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)
Pages	40-43
Number of pages	4
Edition	2
DOIs	https://doi.org/10.1063/1.2836099
Publication status	Published - Dec 1 2007
Event	International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007 - Corfu, Greece Duration: Sept 25 2007 → Sept 30 2007

Publication series

Name	AIP Conference Proceedings
Number	2
Volume	963
ISSN (Print)	0094-243X
ISSN (Electronic)	1551-7616

Other

Other	International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007
Country/Territory	Greece
City	Corfu
Period	9/25/07 → 9/30/07

All Science Journal Classification (ASJC) codes

Ecology, Evolution, Behavior and Systematics
Ecology
Plant Science
Physics and Astronomy(all)
Nature and Landscape Conservation

Access to Document

10.1063/1.2836099

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. 40-43). (AIP Conference Proceedings; Vol. 963, No. 2). https://doi.org/10.1063/1.2836099

SMMH - A parallel Heuristic for combinatorial optimization problems. / Domingues, Guilherme; Morie, Yoshiyuki; Gu, Feng Long et al.

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. 40-43 (AIP Conference Proceedings; Vol. 963, No. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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. 40-43, International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007, Corfu, Greece, 9/25/07. https://doi.org/10.1063/1.2836099

@inproceedings{971d787b829c46758d2345ba25606e55,

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 = dec,

day = "1",

doi = "10.1063/1.2836099",

language = "English",

isbn = "9780735404786",

series = "AIP Conference Proceedings",

number = "2",

pages = "40--43",

booktitle = "Computation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)",

edition = "2",

note = "International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007 ; Conference date: 25-09-2007 Through 30-09-2007",

}

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=71449089261&partnerID=8YFLogxK

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

U2 - 10.1063/1.2836099

DO - 10.1063/1.2836099

M3 - Conference contribution

AN - SCOPUS:71449089261

SN - 9780735404786

T3 - AIP Conference Proceedings

SP - 40

EP - 43

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

T2 - International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007

Y2 - 25 September 2007 through 30 September 2007

ER -

SMMH - A parallel Heuristic for combinatorial optimization problems

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this