{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:50:14Z","timestamp":1762210214360},"reference-count":35,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0305-0548(02)00028-x","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T19:05:42Z","timestamp":1038855942000},"page":"603-624","source":"Crossref","is-referenced-by-count":23,"title":["Modelling competitive Hopfield networks for the maximum clique problem"],"prefix":"10.1016","volume":"30","author":[{"given":"G.","family":"Gal\u00e1n-Mar\u0131\u0301n","sequence":"first","affiliation":[]},{"given":"E.","family":"M\u00e9rida-Casermeiro","sequence":"additional","affiliation":[]},{"given":"J.","family":"Mu\u00f1oz-P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00028-X_BIB1","series-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","article-title":"The maximum clique problem","volume":"4","author":"Pardalos","year":"1994","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB3","doi-asserted-by":"crossref","unstructured":"Feige U, Goldwasser S, Lovasz L, Safra S, Szegedy M. Approximating clique is almost NP-complete. Proceedings of the 32nd IEEE Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1991. p. 2\u201312.","DOI":"10.1109\/SFCS.1991.185341"},{"issue":"1","key":"10.1016\/S0305-0548(02)00028-X_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(05)80002-X","article-title":"A note on the approximation of the maxclique problem","volume":"40","author":"Crescenzi","year":"1991","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/S0305-0548(02)00028-X_BIB5","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","article-title":"Finding a maximum clique in an arbitrary graph","volume":"15","author":"Balas","year":"1986","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00207169008803851","article-title":"A global optimization approach for solving the maximum clique problem","volume":"33","author":"Pardalos","year":"1990","journal-title":"International Journal of Computer Mathematics"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","article-title":"An exact algorithm for the maximum clique problem","volume":"9","author":"Carraghan","year":"1990","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","article-title":"Computational aspects of a branch and bound algorithm for quadratic zero-one programming","volume":"45","author":"Pardalos","year":"1990","journal-title":"Computing"},{"issue":"5","key":"10.1016\/S0305-0548(02)00028-X_BIB9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","article-title":"A branch and bound algorithm for the maximum clique problem","volume":"19","author":"Pardalos","year":"1992","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biological Cybernetics"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB11","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1073\/pnas.81.10.3088","article-title":"Neurons with graded response have collective computational properties like those of two-state neurons","volume":"81","author":"Hopfield","year":"1984","journal-title":"Proceedings of National Academy of Sciences"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB12","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","article-title":"Neural networks and physical systems with emergent collective computational abilities","volume":"79","author":"Hopfield","year":"1982","journal-title":"Proceedings of National Academy of Sciences"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00363956","article-title":"On the stability of the TSP problem algorithm of Hopfield and Tank","volume":"58","author":"Wilson","year":"1988","journal-title":"Biological Cybernetics"},{"issue":"7","key":"10.1016\/S0305-0548(02)00028-X_BIB14","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1016\/0893-6080(96)00017-2","article-title":"An investigation into the improvement of local minima of the Hopfield Network","volume":"9","author":"Peng","year":"1996","journal-title":"Neural Networks"},{"issue":"6","key":"10.1016\/S0305-0548(02)00028-X_BIB15","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1109\/72.548179","article-title":"Improving convergence and solution quality of Hopfield-type neural networks with augmented Lagrange multipliers","volume":"7","author":"Li","year":"1996","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"1","key":"10.1016\/S0305-0548(02)00028-X_BIB16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1162\/neco.1994.6.1.161","article-title":"Polyhedral combinatorics and neural networks","volume":"6","author":"Gee","year":"1994","journal-title":"Neural Computation"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB17","series-title":"Neural network parallel computing","author":"Takefuji","year":"1992"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB18","doi-asserted-by":"crossref","unstructured":"Takefuji Y, Wang J. Neural computing for optimization and combinatorics. Singapore: World Scientific, 1996 (Chapter 3).","DOI":"10.1142\/1953"},{"issue":"1","key":"10.1016\/S0305-0548(02)00028-X_BIB19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1109\/72.80215","article-title":"A parallel algorithm for tiling problems","volume":"1","author":"Takefuji","year":"1990","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"1","key":"10.1016\/S0305-0548(02)00028-X_BIB20","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/72.105427","article-title":"A parallel improvement algorithm for the bipartite subgraph problem","volume":"3","author":"Lee","year":"1992","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"3","key":"10.1016\/S0305-0548(02)00028-X_BIB21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1080\/00207219208925577","article-title":"A generalized maximum neural network for the module orientation problem","volume":"72","author":"Lee","year":"1992","journal-title":"International Journal of Electronics"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB22","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s004220050337","article-title":"A maximum neural network approach for N-queens problem","volume":"76","author":"Funabiki","year":"1997","journal-title":"Biological Cybernetics"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB23","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/0743-7315(92)90072-U","article-title":"A neural network model for finding a near-maximum clique","volume":"14","author":"Funabiki","year":"1992","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB24","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00224701","article-title":"An artificial hysteresis binary neuron: a model suppressing the oscillatory behaviors of neural dynamics","volume":"64","author":"Takefuji","year":"1991","journal-title":"Biological Cybernetics"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB25","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/31.101328","article-title":"Artificial neural networks for four-colouring map problems and K-colorability problems","volume":"38","author":"Takefuji","year":"1991","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB26","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","article-title":"A logical calculus of the ideas immanent in nervous activity","volume":"5","author":"McCulloch","year":"1943","journal-title":"Bulletin of Mathematical Biophysics"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB27","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00204397","article-title":"An artificial maximum neural network: a winner-take-all neuron model forcing the state of the system in a solution domain","volume":"67","author":"Takefuji","year":"1992","journal-title":"Biological Cybernetics"},{"issue":"11","key":"10.1016\/S0305-0548(02)00028-X_BIB28","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/0031-3203(94)90128-7","article-title":"Polygonal approximation using a competitive Hopfield neural network","volume":"27","author":"Chung","year":"1994","journal-title":"Pattern Recognition"},{"issue":"I","key":"10.1016\/S0305-0548(02)00028-X_BIB29","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/81.273927","article-title":"Comments on artificial neural networks for four-colouring map problems and K-colorability problems","volume":"41","author":"Tateishi","year":"1994","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB30","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/72.557700","article-title":"Discrete-time convergence theory and updating rules for neural networks with energy functions","volume":"8","author":"Wang","year":"1997","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB31","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0098187","article-title":"A new input\u2013output function for binary Hopfield neural networks","volume":"1606","author":"Gal\u00e1n-Mar\u0131\u0301n","year":"1999","journal-title":"Lecture Notes in Computer Science, Foundations and Tools for Neural Modeling"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB32","unstructured":"Gal\u00e1n-Mar\u0131\u0301n G, Mu\u00f1oz-P\u00e9rez J. Design of a neural network for solving the four-color-map problem. Iberoamerican Journal of Artificial Intelligence 1999;8:6\u201317 (in Spanish)."},{"key":"10.1016\/S0305-0548(02)00028-X_BIB33","unstructured":"Gal\u00e1n-Mar\u0131\u0301n G. Recurrent neural networks for combinatorial optimization. Ph.D. dissertation, University of M\u00e1laga, 2000 (in Spanish)."},{"key":"10.1016\/S0305-0548(02)00028-X_BIB34","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","article-title":"Some network flow problems solved with pseudo-Boolean programming","volume":"13","author":"Hammer","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00028-X_BIB35","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","article-title":"Experiments in quadratic 0\u20131 programming","volume":"44","author":"Barahona","year":"1989","journal-title":"Mathematical Programming"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480200028X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480200028X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T16:29:13Z","timestamp":1680712153000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505480200028X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S030505480200028X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00028-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}