TY - GEN
T1 - A maximum neural network for the max cut problem
AU - Lee, Kuo Chun
AU - Takefuji, Yoshiyasu
AU - Funabiki, Nobuo
PY - 1991/12/1
Y1 - 1991/12/1
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
AN - SCOPUS:0026400953
SN - 0780301641
T3 - Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks
SP - 379
EP - 384
BT - Proceedings. IJCNN-91-Seattle
A2 - Anon, null
PB - Publ by IEEE
T2 - International Joint Conference on Neural Networks - IJCNN-91-Seattle
Y2 - 8 July 1991 through 12 July 1991
ER -