Linear programming and simple associative memories (Q2640322): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5736638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organization and associative memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal nonlinear associative recall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning representations by back-propagating errors / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:28, 21 June 2024

scientific article
Language Label Description Also known as
English
Linear programming and simple associative memories
scientific article

    Statements

    Linear programming and simple associative memories (English)
    0 references
    0 references
    1990
    0 references
    \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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linear programming
    0 references
    linear and quadratic associative memory approaches
    0 references
    transportation problem
    0 references