Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Chua, L. Yang (1988)
Cellular neural networks: theoryIEEE Transactions on Circuits and Systems, 35
N. Sengor, M. Yalçin, Y. Çakir, M. Ucer, C. Guzelis, F. Pekergin, Ö. Morgül (1998)
Solving maximum clique problem by cellular neural networkElectronics Letters, 34
F. Pekergin, O. Morgui, C. Guzelis (1999)
A saturated linear dynamical network for approximating maximum cliqueIEEE Transactions on Circuits and Systems I-regular Papers, 46
Luitpold Babel, G. Tinhofer (1990)
A branch and bound algorithm for the maximum clique problemZeitschrift für Operations Research, 34
P. Pardalos, A. Phillips (1990)
A global optimization approach for solving the maximum clique problemInternational Journal of Computer Mathematics, 33
P. Pardalos, J. Xue (1994)
The maximum clique problemJournal of Global Optimization, 4
MW Hirsch, S Smale (1974)
Dynamical systems and linear algebra
(1976)
Adaptive pattern classi"cation and universal recording
H. Chiang, C. Chu (1994)
A systematic search method for obtaining multiple local optimal solutions of nonlinear programming problemsProceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94, 1
(1974)
Di ! erential equations
HD Chiang, CC Chu (1996)
A systematic search method for obtaining multiple local optimal solutions of nonlinear programming problemsIEEE Trans CASI, 43
L Hou, AN Michel (1998)
Asimptotic stability of systems with saturation constraintsIEEE Trans Automatic Control, 43
J. Lasalle (1968)
Stability theory for ordinary differential equations.Journal of Differential Equations, 4
MR Garey, DS Johnson (1979)
Computers and intractibility: a guide to the theory of NP-completeness
(1995)
Applying the INN model to the max clique problem. Second DIMACS Implementation Challenge
E. Polak (1973)
Introduction to linear and nonlinear programming
(1994)
A Hop " eld style network with graph theoretic characterization
(1974)
Second DIMACS Implementation Challenge, DIMACS series in Discrete Math and Theoretical Comp Science
Ling Hou, A. Michel (1996)
Asymptotic stability of systems with saturation constraintsProceedings of 35th IEEE Conference on Decision and Control, 3
(1988)
Theory, \IEEE Trans
P. Crescenzi, C. Fiorini, R. Silvestri (1991)
A Note on the Approximation of the MAX CLIQUE ProblemInf. Process. Lett., 40
J. Hopfield (1982)
Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences of the United States of America, 79 8
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,''
N. Funabiki, Yoshiyasu Takefuji, K. Lee (1992)
A Neural Network Model for Finding a Near-Maximum CliqueJ. Parallel Distributed Comput., 14
PM Pardalos, GP Rodgers (1992)
A branch and bound algorithm for the maximum clique problemComp Ops Res 19, 5
T. Motzkin, E. Straus (1965)
Maxima for Graphs and a New Proof of a Theorem of TuránCanadian Journal of Mathematics, 17
L. Chua, Niantsu Wang (1978)
Complete stability of autonomous reciprocal nonlinear networksInternational Journal of Circuit Theory and Applications, 6
A. Jagota (1995)
Approximating maximum clique with a Hopfield networkIEEE transactions on neural networks, 6 3
C. Chong (1979)
Nonlinear systems analysisProceedings of the IEEE, 67
JJ Hopfield (1982)
Neural networks and physical systems with emergent collective computational abilitiesProc Math Acad Sci, 79
M. Pelillo (1996)
Relaxation labeling networks for the maximum clique problem, 2
M. Hirsch, S. Smale (1974)
Differential Equations, Dynamical Systems, and Linear Algebra
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
Several formulations and methods used in solving an NP-hard discrete optimization problem, maximum clique, are considered in a dynamical system perspective proposing continuous methods to the problem. A compact form for a saturated linear dynamical network, recently developed for obtaining approximations to maximum clique, is given so its relation to the classical gradient projection method of constrained optimization becomes more visible. Using this form, gradient-like dynamical systems as continuous methods for finding the maximum clique are discussed. To show the one to one correspondence between the stable equilibria of the saturated linear dynamical network and the minima of objective function related to the optimization problem, La Salle’s invariance principle has been extended to the systems with a discontinuous right-hand side. In order to show the efficiency of the continuous methods simulation results are given comparing saturated the linear dynamical network, the continuous Hopfield network, the cellular neural networks and relaxation labelling networks. It is concluded that the quadratic programming formulation of the maximum clique problem provides a framework suitable to be incorporated with the continuous relaxation of binary optimization variables and hence allowing the use of gradient-like continuous systems which have been observed to be quite efficient for minimizing quadratic costs.
ARI - An International Journal for Physical and Engineering Sciences – Springer Journals
Published: Apr 24, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.