Path: utzoo!attcan!uunet!lll-winken!lll-lcc!ames!mailrus!pan!jal
From: jal@pan (Jason Leigh)
Newsgroups: comp.ai.neural-nets
Subject: Neural nets, TSP and Assignment
Message-ID: <525@pan>
Date: 12 Feb 89 03:14:38 GMT
Reply-To: jal@cs.wayne.edu (Jason Leigh)
Distribution: na
Organization: Computer Science Department, Wayne State University
Lines: 12

I am trying to solve the Assignment problem (maximum matching on
minimal weight in a bi-partite graph) using Neural Nets (more specifically
the Boltzmann Machine).  Has anyone done this already?  Is there a
good way to approach this besides converting the problem to TSP
and then solving that?

If you have any ideas on a good implementation or energy function for
the assignment problem, please let me know.

Thanks.
jal@zeus.cs.wayne.edu
Jason Leigh