Constrained optimization with use of two-dimensional maximum neurons

A special neuron, which we call two-dimensional maximum neuron is proposed. This type of neuron can eliminate the row and column constraints that occur in many problems, such as the stable marriage problem. A parallel processing algorithm to find the stable marriage matching using the proposed two-dimensional maximum neurons is described and the result is now reported.<<ETX>>