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.
Recommendations
Cites work
- ``Neural computation of decisions in optimization problems
- Assignment Problems and the Location of Economic Activities
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3200250 (Why is no real title available?)
- Learning representations by back-propagating errors
- On optimal nonlinear associative recall
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Self-organization and associative memory
Cited in
(7)- Kalaba's associative memories for system identification
- Linear programming, recurrent associative memories, and feed-forward neural networks
- Recurrent neural networks for linear programming: Analysis and design principles
- Obtaining initial parameter estimates for nonlinear systems using multicriteria associative memories
- scientific article; zbMATH DE number 27685 (Why is no real title available?)
- LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES
- scientific article; zbMATH DE number 1225788 (Why is no real title available?)
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)