Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!ucsd!pacbell.com!ames!uhccux!eiles.kaist.ac.kr!duck
From: duck@eiles.kaist.ac.kr (Jung Joo-won)
Newsgroups: comp.ai.neural-nets
Subject: Help!! (NP-complete using NNs)
Keywords: NP-complete, TSP, survey
Message-ID: <13648@uhccux.uhcc.Hawaii.Edu>
Date: 26 Jun 91 06:53:39 GMT
Sender: news@uhccux.uhcc.Hawaii.Edu
Distribution: usa
Organization: KAIST in Daeduk Korea
Lines: 20
Originator: duck@eiles.kaist.ac.kr


Hi, all
It is the first time to post a news. :)
I plan to survey about the approaches to solve NP-complete problems
using Neural networks. Does anyone know the papers or technical reports
about these area? Where can I get TR's in internet? Do you happen to
know someone get optimal solution (real optimal not local minima)
faster than branch and bound algorithm using NN's?
Many advices expected.

Thanks in advance

Mt.Duck

------------------------------------------------------------------------------
Jung, Joo-Won				| Dorm.  : +82 42-820-4565
Dept. of Computer Science		| Home   : +82  2-483-3869
Korea Advanced Institute of Science and	| E-mail : jwjung@adam.kaist.ac.kr
  Technology, Taejon, Korea, 305-701	|	   duck@eiles.kaist.ac.kr
==============================================================================