Neural algorithms for placement problems

Kiichi Urahama, Hiroshi Nishiyuki

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

Two improved neural algorithms are presented for solving a placement problem which is a familiar class of NP-hard quadratic assignment problems. Formulation of the problem as a zero-one integer programming leads to an improved form of the Hopfield networks, while a mixed integer programming formulation results in an analogue algorithm similar to the elastic nets. The outermost loop in these algorithms performs an automatically scheduled deterministic annealing. This gives us a natural interpretation of the annealing procedure derived straightforwardly from the mathematical programming framework. Experiments reveal that the adaptive elastic net algorithm outperforms the adaptive Hopfield method.

本文言語英語
ホスト出版物のタイトルProceedings of the International Joint Conference on Neural Networks
出版社Publ by IEEE
ページ2421-2424
ページ数4
3
ISBN(印刷版)0780314212, 9780780314214
出版ステータス出版済み - 1993
外部発表はい
イベントProceedings of 1993 International Joint Conference on Neural Networks. Part 1 (of 3) - Nagoya, Jpn
継続期間: 10 25 199310 29 1993

その他

その他Proceedings of 1993 International Joint Conference on Neural Networks. Part 1 (of 3)
CityNagoya, Jpn
Period10/25/9310/29/93

All Science Journal Classification (ASJC) codes

  • Engineering(all)

フィンガープリント 「Neural algorithms for placement problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル