• DocumentCode
    856680
  • Title

    Knapsack packing networks

  • Author

    Hellstrom, Benjamin J. ; Kanal, Laveen N.

  • Author_Institution
    Westinghouse Electr. Corp., Baltimore, MD, USA
  • Volume
    3
  • Issue
    2
  • fYear
    1992
  • fDate
    3/1/1992 12:00:00 AM
  • Firstpage
    302
  • Lastpage
    307
  • Abstract
    A knapsack packing neural network of 4n units with both low-order and conjunctive asymmetric synapses is derived from a non-Hamiltonian energy function. Parallel simulations of randomly generated problems of size n in {5, 10, 20} are used to compare network solutions with those of simple greedy fast parallel enumerative algorithms
  • Keywords
    computational complexity; neural nets; optimisation; computational complexity; conjunctive asymmetric synapses; knapsack packing neural network; nonHamiltonian energy function; optimisation; parallel simulation; simple greedy fast parallel enumerative algorithms; Artificial neural networks; Computer networks; Concurrent computing; Hopfield neural networks; Hypercubes; Neural networks; Optimization methods; Space exploration; Stability; Traveling salesman problems;
  • fLanguage
    English
  • Journal_Title
    Neural Networks, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9227
  • Type

    jour

  • DOI
    10.1109/72.125871
  • Filename
    125871
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=856680