SMMH - A parallel Heuristic for combinatorial optimization problems

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

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

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.

元の言語英語
ホスト出版物のタイトルComputation in Modern Science and Engineering - Proceedings of the International Conference on Computational Methods in Science and Engineering 2007 (ICCMSE 2007)
ページ40-43
ページ数4
エディション2
DOI
出版物ステータス出版済み - 12 1 2007
イベントInternational Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007 - Corfu, ギリシャ
継続期間: 9 25 20079 30 2007

出版物シリーズ

名前AIP Conference Proceedings
番号2
963
ISSN(印刷物)0094-243X
ISSN(電子版)1551-7616

その他

その他International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007
ギリシャ
Corfu
期間9/25/079/30/07

Fingerprint

optimization
spin glass
specifications
physics
energy
simulation

All Science Journal Classification (ASJC) codes

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

これを引用

Domingues, G., Morie, Y., Gu, F. L., Nanri, T., & Murakami, K. (2007). 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 版, pp. 40-43). (AIP Conference Proceedings; 巻数 963, 番号 2). https://doi.org/10.1063/1.2836099

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. 編 2007. p. 40-43 (AIP Conference Proceedings; 巻 963, 番号 2).

研究成果: 著書/レポートタイプへの貢献会議での発言

Domingues, G, Morie, Y, Gu, FL, Nanri, T & Murakami, K 2007, 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 Edn, AIP Conference Proceedings, 番号 2, 巻. 963, pp. 40-43, International Conference on Computational Methods in Science and Engineering 2007, ICCMSE 2007, Corfu, ギリシャ, 9/25/07. https://doi.org/10.1063/1.2836099
Domingues G, Morie Y, Gu FL, Nanri T, Murakami K. 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 版 2007. p. 40-43. (AIP Conference Proceedings; 2). https://doi.org/10.1063/1.2836099
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. 版 2007. pp. 40-43 (AIP Conference Proceedings; 2).
@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 = "12",
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",

}

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)

ER -