{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:12:59Z","timestamp":1773655979824,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1023\/a:1012395712371","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T12:43:55Z","timestamp":1040647435000},"page":"265-288","source":"Crossref","is-referenced-by-count":9,"title":["On solving the maximum clique problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Antonina","family":"Kuznetsova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Strekalovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"360701_CR1","volume-title":"Nonlinear Programming Theory and Algorithms","author":"M.S. Bazaraa","year":"1979","unstructured":"Bazaraa, M.S. and Shetty, C.M. (1979), Nonlinear Programming Theory and Algorithms, John Wiley and Sons, New York."},{"key":"360701_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"I. Bomze","year":"1997","unstructured":"Bomze, I. (1997), Evolution towards the maximum clique, Journal of Global Optimization, 10, 143-164.","journal-title":"Journal of Global Optimization"},{"key":"360701_CR3","first-page":"1","volume-title":"Handbook of Combinatorial Optimization, Suppl. Vol. A.","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M. and Pelillo, M. (1999), The maximum clique problem, In: Du, D.-Z. and Pardalos, P.M. (eds.), Handbook of Combinatorial Optimization, Suppl. Vol. A., Kluwer Academic Publishers, Boston, pp. 1-74."},{"key":"360701_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-4757-2600-8_6","volume-title":"Developments in Global Optimization, 18","author":"I.M. Bomze","year":"1997","unstructured":"Bomze, I.M., Pelillo, M. and Giacomini, R. (1997), Evolutionary Approach to the Maximum Clique Problem: Empirical Evidence on a Large Scale, In: Bomze, I.M., Csendes, T., Horst, R. and Pardalos, P.M. (eds.), Developments in Global Optimization, 18, Kluwer Academic Publishers, Dordrecht, pp. 95-108."},{"key":"360701_CR5","volume-title":"Computer and Intractability, A Guide to The Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M. and Johnson, D. (1979), Computer and Intractability, A Guide to The Theory of NP-Completeness, Freeman, San Francisco."},{"key":"360701_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1090\/dimacs\/026\/07","volume":"26","author":"L.E. Gibbons","year":"1995","unstructured":"Gibbons, L.E., Hearn, D.W. and Pardalos P.M. (1995), A continuous based heuristic for the maximum clique problem, In: Johnson, D.S., Trick, M. (eds.), Clique, Graph Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 26, 103-124.","journal-title":"Clique, Graph Coloring, and Satisfiability: Second DIMACS Implementation Challenge"},{"key":"360701_CR7","volume-title":"Introduction to Global Optimization, 3","author":"R. Horst","year":"1995","unstructured":"Horst, R., Pardalos, P.M. and Thoai, V. (1995), Introduction to Global Optimization, 3, Kluwer, Dordrecht."},{"key":"360701_CR8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin, T.S. and Straus, E.G. (1965), Maxima for graphs and a new proof of a theorem of Tur\u00e1n, Cand. J. Math., 17, 533-540.","journal-title":"Cand. J. Math."},{"key":"360701_CR9","first-page":"313","volume":"2","author":"M. Pelillo","year":"1995","unstructured":"Pelillo, M. (1995), Relaxation labeling networks for the maximum clique problem, Journal of Artificial Neural Networks, 2, 313-327.","journal-title":"Journal of Artificial Neural Networks"},{"key":"360701_CR10","first-page":"411","volume":"2","author":"M. Pelillo","year":"1995","unstructured":"Pelillo, M. and Jagota A. (1995), Feasible and infeasible maxima in a quadratic program for maximum clique, Journal of Artificial Neural Networks, 2, 411-420.","journal-title":"Journal of Artificial Neural Networks"},{"key":"360701_CR11","volume-title":"On Global Optimality Conditions for D.C. Programming Problems","author":"A.S. Strekalovsky","year":"1997","unstructured":"Strekalovsky, A.S. (1997), On Global Optimality Conditions for D.C. Programming Problems, Irkutsk University Press, Irkutsk."},{"key":"360701_CR12","first-page":"315","volume":"33","author":"A.S. Strekalovsky","year":"1993","unstructured":"Strekalovsky, A.S. (1993), The search for a global maximum of a convex functional on an admissible set, Comput. Math. and Math. Physics, 33, 315-328, Pergamon Press.","journal-title":"Comput. Math. and Math. Physics"},{"key":"360701_CR13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008260227877","volume":"13","author":"A.S. Strekalovsky","year":"1998","unstructured":"Strekalovsky, A.S. and Tsevendorj, I. (1998), Testing the \u211c-strategy for a Reverse Convex Problem, Journal of Global Optimization 13, 61-74.","journal-title":"Journal of Global Optimization"},{"key":"360701_CR14","first-page":"6","volume":"39","author":"A.A. Kuznetsova","year":"1999","unstructured":"Kuznetsova, A.A., Strekalovsky A.S. and Tsevendorj I. (1999), An approach to the solution of integer optimization problem, Comput. Math. and Math. Physics, 39, 6-13.","journal-title":"Comput. Math. and Math. Physics"},{"key":"360701_CR15","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/978-1-4757-3226-9_23","volume-title":"Nonlinear Optimization and Related Topics, 36","author":"A.S. Strekalovsky","year":"2000","unstructured":"Strekalovsky A.S., (2000) One way to Construct a Global Search Algorithm for d.c. Minimization Problems In: Pillo, G. Di., Giannessi, F. (eds.), Nonlinear Optimization and Related Topics, 36, Kluwer, Dordrecht, pp. 429-443."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012395712371.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1012395712371\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012395712371.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:48:17Z","timestamp":1751366897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1012395712371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["360701"],"URL":"https:\/\/doi.org\/10.1023\/a:1012395712371","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}