a cellular network assignment processor for solving optimization problems utilizing a neural network architecture having a matrix of simple processing cells that are highly interconnected in a regular structure . the cells accept as input , costs in an assignment problem . the position of each cell corresponds to the position of the cost in the associated constraint space of the assignment problem . each cell is capable of receiving , storing and transmitting cost values and is also capable of determining if it is the maximum or the minimum of cells to which it &# 39 ; s connected . operating on one row of cells at a time the processor determines if a conflict exists between selected connected cells until a cell with no conflict is found in each row . the end result is a chosen cell , in each row , the chosen cells together representing a valid solution to the assignment problem .