[comp.ai.neural-nets] Neural nets, TSP and Assignment

jal@pan (Jason Leigh) (02/12/89)

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