LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES

DOI10.1080/03081079208945025zbMath0745.90073OpenAlexW2020956291MaRDI QIDQ3989288

No author found.

Publication date: 28 June 1992

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079208945025

zbMATH Keywords

approximate solutionsconstrained optimizationlinear associative memory matricesRecurrent neural network structures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Neural networks for/in biological studies, artificial life and related topics (92B20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Self-organization and associative memory
• On optimal nonlinear associative recall
• Assignment Problems and the Location of Economic Activities
• Learning representations by back-propagating errors
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES