Linear programming and simple associative memories

From MaRDI portal





\textit{T. Kohonen}'s [Self-organization and associative memory (1988; Zbl 0659.68100)] and \textit{T. Poggio}'s [On optimal nonlinear recall, Biolog. Cybernetics 19, 201-209 (1975; Zbl 0321.94001)] linear and quadratic associative memory approaches are proposed for identifying approximate solutions of the standard transportation problem. The utility of these procedures is tested on a very small example: 2 sources, 2 sinks, total supply 5, total demand 5, fixed objective function.











This page was built for publication: Linear programming and simple associative memories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640322)