Neural network approach to zero-one optimal covering problem
References
[1]
F.S. Hillier & G. J. Lieberman, Introduction t_oo Operation Research, San Fransisco- Holden-Day Inc., and New York- Mcgraw-Hill, Inc 1988 (4th Edition).
[2]
Z. Kohavi, Switchinq and Finite Automata Theorv, New York" McGraw-Hill, 1978.
[3]
J.P. Hayes, Computer Architecture and Orqanization, New York-McGraw-Hill, 1988 (2nd Edition).
[4]
J. Allen, Introduction t__oo VLSI Desiqn. MIT-Video Course, Cambridge, MA- Massachusetts Institute of Technology, 1984.
[5]
C. Mead & L. Conway, introduction to VLSI Desiqn Reading, MA" Addison Wesley, 1980.
[6]
H.P. Graf, L.D. Jackel & W.E. Hubbard, "VLSI Implementation of a Neural Network Model," i~ Computer, March 1988, pp. 41-49.
[7]
K. Nakano, "Associatron A Model of Associative Memory," IR1m~Trans. S~K), Vol. SMC-2, 1972.
[8]
M.P. Kennedy & L.0. Chua, "Unifying the Tank and Hopfield Linear Programming Circuit, and the Canonical Nonlinear Programming Cir-II cult of Chau and Lin, IEEE Trans. Circuits, and Systenms, Vol CAS-34, No. 2, February 1987, pp. 210-214.
[9]
J.Ramanujam & P. Sadayapan, "Optimization by Neural " Proc of the Networks, IJ(3RN Conf., July 1988, pp. 325-332.
[10]
M. Takeda & J.W. Goodman, "Neural Networks for Computation" Number Representations and Programming Complexity, " Applied Optics, Vol. 25, September 1986, pp. 3033-3046.
[11]
D.W. Tank & j.J. Hopfield, "Simple 'Neural' Optimization Networks" An A/D Converter, Signal Decision Circuit, and Linear Programming Circuit, " IKK~ Trans. Circuits and System, Vol. CAS-33, 1986, pp. 21 6-232.
[12]
S. R. Das, D.K. Banerji & A. Chattopadhyay, "On Control Memory Minimization in Microprogrammed Computers, " I~ Trans. ~ut., Vol. C-23, Sept. 1973, pp. 845- 848,
[13]
C. Mead, Analoq VLSI and Neural Svst~, Reading, MA" Addison-Wesley, 1989.
[14]
A. R. Khan, "Neural Network Approach to the Zero-One Optimal Covering Problem, " M.S. Thesis, Department of Electrical Engineering, Southern Illinois University, Carbondale, Illinois, May 1 990.
[15]
H.C. Torng, Switchinq Circuits" Theory, and ~ic Desiqn, MA" Addison-Wesley, 1972.
[16]
J.j. Hopfield, "Neural Networks- Algorithms and Microhardware," Technical Tutorial Seminar, Product No. HV0127-I, 1989.
[17]
D.W. Tank & J.J. Hopfield, "Collective Computation in Neuronlike Circuits," Scientific American, 1 989, pp. 104-114.
[18]
M.P. Kennedy & L. O. Chua, "Unifying the Tank and Hopfield Linear Programming Circuit, and the Canonical Nonlinear Programming Circuit of Chua and Lin," IKKK Trans. Circuits, And Systems, Vol CAS-34, No. 2, February 1987, pp. 21 0-21 4.
[19]
T. Kohonen, "Correlation Matrix Memories, " IK~R Trans. Computer, C-21,1972.
[20]
B. Kasko, "Constructing an Associative Memory," Byte September 1987, pp. 137- 144.
[21]
R.P. Lippmann, "An Introdution to Computing with Neural-Nets, " I~ Acoustics, Speech, and Signal Processing, Vol. 4, 1987, pp. 4-22.
[22]
R.P. Lippmann, B. Gold & M. L. Malpass, "A Comparison of Hamming and Hopfield Neural Nets for Pattern Classification," MIT Lin coln Laboratory Report, TR- 769, May 1987.
Index Terms
- Neural network approach to zero-one optimal covering problem
Recommendations
An artificial neural network for solving quadratic zero-one programming problems
This paper presents an artificial neural network to solve the quadratic zero-one programming problems under linear constraints. In this paper, by using the connection between integer and nonlinear programming, the quadratic zero-one programming problem ...
Neural network approach to zero-one optimal covering problem
ANSS '91: Proceedings of the 24th annual symposium on SimulationA neural network approach for solving linear bilevel programming problem
A novel neural network approach is proposed for solving linear bilevel programming problem. The proposed neural network is proved to be Lyapunov stable and capable of generating optimal solution to the linear bilevel programming problem. The numerical ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1991 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1991
Published in SIGSIM Volume 21, Issue 3
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 354Total Downloads
- Downloads (Last 12 months)51
- Downloads (Last 6 weeks)9
Reflects downloads up to 09 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in