A maximum neural network for the max cut problem

Kuo Chun Lee, Yoshiyasu Takefuji, Nobuo Funabiki

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

4 Citations (Scopus)

Abstract

The max cut problem, one of the NP-complete problems, was chosen to test the capability of an artificial neural network. The algorithm based on the maximum neural network was tested by 1000 randomly generated examples, including up to 300 vertex problems. The simulation result shows that the proposed parallel algorithm using the maximum neural network generates better solutions than Hsu's algorithm within one hundred iteration steps, regardless of the problem size.

Original languageEnglish
Title of host publicationProceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks
Editors Anon
PublisherPubl by IEEE
Pages379-384
Number of pages6
ISBN (Print)0780301641
Publication statusPublished - 1991
Externally publishedYes
EventInternational Joint Conference on Neural Networks - IJCNN-91-Seattle - Seattle, WA, USA
Duration: 1991 Jul 81991 Jul 12

Other

OtherInternational Joint Conference on Neural Networks - IJCNN-91-Seattle
CitySeattle, WA, USA
Period91/7/891/7/12

Fingerprint

Neural networks
Parallel algorithms
Computational complexity

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lee, K. C., Takefuji, Y., & Funabiki, N. (1991). A maximum neural network for the max cut problem. In Anon (Ed.), Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks (pp. 379-384). Publ by IEEE.

A maximum neural network for the max cut problem. / Lee, Kuo Chun; Takefuji, Yoshiyasu; Funabiki, Nobuo.

Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks. ed. / Anon. Publ by IEEE, 1991. p. 379-384.

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

Lee, KC, Takefuji, Y & Funabiki, N 1991, A maximum neural network for the max cut problem. in Anon (ed.), Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks. Publ by IEEE, pp. 379-384, International Joint Conference on Neural Networks - IJCNN-91-Seattle, Seattle, WA, USA, 91/7/8.
Lee KC, Takefuji Y, Funabiki N. A maximum neural network for the max cut problem. In Anon, editor, Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks. Publ by IEEE. 1991. p. 379-384
Lee, Kuo Chun ; Takefuji, Yoshiyasu ; Funabiki, Nobuo. / A maximum neural network for the max cut problem. Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks. editor / Anon. Publ by IEEE, 1991. pp. 379-384
@inproceedings{24868ab82bf54c7e8bff58a1575a7694,
title = "A maximum neural network for the max cut problem",
abstract = "The max cut problem, one of the NP-complete problems, was chosen to test the capability of an artificial neural network. The algorithm based on the maximum neural network was tested by 1000 randomly generated examples, including up to 300 vertex problems. The simulation result shows that the proposed parallel algorithm using the maximum neural network generates better solutions than Hsu's algorithm within one hundred iteration steps, regardless of the problem size.",
author = "Lee, {Kuo Chun} and Yoshiyasu Takefuji and Nobuo Funabiki",
year = "1991",
language = "English",
isbn = "0780301641",
pages = "379--384",
editor = "Anon",
booktitle = "Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - A maximum neural network for the max cut problem

AU - Lee, Kuo Chun

AU - Takefuji, Yoshiyasu

AU - Funabiki, Nobuo

PY - 1991

Y1 - 1991

N2 - The max cut problem, one of the NP-complete problems, was chosen to test the capability of an artificial neural network. The algorithm based on the maximum neural network was tested by 1000 randomly generated examples, including up to 300 vertex problems. The simulation result shows that the proposed parallel algorithm using the maximum neural network generates better solutions than Hsu's algorithm within one hundred iteration steps, regardless of the problem size.

AB - The max cut problem, one of the NP-complete problems, was chosen to test the capability of an artificial neural network. The algorithm based on the maximum neural network was tested by 1000 randomly generated examples, including up to 300 vertex problems. The simulation result shows that the proposed parallel algorithm using the maximum neural network generates better solutions than Hsu's algorithm within one hundred iteration steps, regardless of the problem size.

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

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

M3 - Conference contribution

SN - 0780301641

SP - 379

EP - 384

BT - Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks

A2 - Anon, null

PB - Publ by IEEE

ER -