{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T18:26:05Z","timestamp":1695579965477},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Sci"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10958-009-9613-x","type":"journal-article","created":{"date-parts":[[2009,9,9]],"date-time":"2009-09-09T03:39:22Z","timestamp":1252467562000},"page":"944-955","source":"Crossref","is-referenced-by-count":7,"title":["A heuristic for the stability number of a graph based on convex quadratic programming and tabu search"],"prefix":"10.1007","volume":"161","author":[{"given":"L.","family":"Cavique","sequence":"first","affiliation":[]},{"given":"C. J.","family":"Luz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,10]]},"reference":[{"key":"9613_CR1","unstructured":"F. Alizadeh, \u201cA sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs,\u201d In: ACM-SIAM Symposium on Discrete Algorithms, Vol. 2, 188\u2013194 (1991)."},{"issue":"3","key":"9613_CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01581168","volume":"80","author":"N Alon","year":"1988","unstructured":"N. Alon and N. Kahale, \u201cApproximating the independence number via the theta-function,\u201d Math. Program., 80, No. 3, 253\u2013264 (1988).","journal-title":"Math. Program."},{"key":"9613_CR3","unstructured":"S. Benson and Y. Ye, \u201cApproximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation,\u201d In: Applications and Algorithms of complementarity, Eds. M. Ferris and J. Pang , Kluwer Academic Publishers, (2000), pp. 1\u201318."},{"key":"9613_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0024-3795(02)00260-4","volume":"351\u2013352","author":"JV Burke","year":"2002","unstructured":"J. V. Burke, A. S. Lewis, and M. L. Overton, \u201cTwo numerical methods for optimizing matrix stability,\u201d Linear Algebra Appl., 351\u2013352, 117\u2013145 (2002).","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"9613_CR5","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/030601296","volume":"15","author":"JV Burke","year":"2005","unstructured":"J. V. Burke, A. S. Lewis, and M. L. Overton, \u201cA robust gradient sampling algorithm for nonsmooth, nonconvex optimization,\u201d SIAM J. Optim., 15, No. 3, 751\u2013779 (2005).","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9613_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10107-002-0356-4","volume":"94","author":"S Burer","year":"2002","unstructured":"S. Burer, R. D. C. Monteiro, and Y. Zhang, \u201cMaximum stable formulations and heuristics based on continuous optimization,\u201d Math Program., 94, No. 1, 137\u2013166 (2002).","journal-title":"Math Program."},{"key":"9613_CR7","series-title":"Classics Appl. Math.","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and nonsmooth analysis","author":"FH Clarke","year":"1990","unstructured":"F. H. Clarke, \u201cOptimization and nonsmooth analysis,\u201d Classics Appl. Math., 5, SIAM, Philadelphia (1990)."},{"key":"9613_CR8","first-page":"1","volume":"22","author":"L Cavique","year":"2002","unstructured":"L. Cavique, C. Rego, and I. Themido, \u201cEstruturas de vizinhan\u00e7a e procura local no problema da clique m\u00e1xima,\u201d Investigac\u00f3n Oper., 22, 1\u201318 (2002).","journal-title":"Investigac\u00f3n Oper."},{"key":"9613_CR9","doi-asserted-by":"crossref","unstructured":"L. Cavique, C. Rego, and I. Themido, \u201cA scatter search algorithm for the maximum clique problem,\u201d In: Essays and Surveys in Metaheuristics, eds. C. Ribeiro and P. Hansen, Kluwer Academic Publishers (2002), pp. 227\u2013244.","DOI":"10.1007\/978-1-4615-1507-4_11"},{"key":"9613_CR10","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers (1997).","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"9613_CR11","unstructured":"F. Glover, \u201cA template for scatter search and path relinking,\u201d In: Lecture Notes in Computer Science, Eds. J.-K. Hao, E. Lutton, E. Ronald, M. Schoenaurer and D. Snyers (1997), pp. 1\u20135."},{"key":"9613_CR12","unstructured":"F. Glover, \u201cScatter search and path relinking,\u201d In: New Ideas in Optimization (D. Corne, M. Dorigo, and F. Glover, eds.), McGraw-Hill International (1999)."},{"key":"9613_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin (1988)."},{"issue":"4","key":"9613_CR14","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1137\/S1052623401394092","volume":"13","author":"G Gruber","year":"2003","unstructured":"G. Gruber and F. Rendl, \u201cComputational experience with stable set relaxations,\u201d SIAM J. Optim., 13, No. 4, 1014\u20131028 (2003).","journal-title":"SIAM J. Optim."},{"key":"9613_CR15","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"D. S. Johnson, \u201cApproximation algorithms for combinatorial problems,\u201d J. Comput. System Sci., 9, 256\u2013278 (1974).","journal-title":"J. Comput. System Sci."},{"key":"9613_CR16","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0074500","volume-title":"Methods of descent for nondifferentiable optimization","author":"KC Kiwiel","year":"1985","unstructured":"K. C. Kiwiel, \u201cMethods of descent for nondifferentiable optimization,\u201d Lecture Notes in Math., 1133, Springer-Verlag, Berlin, New York (1985)."},{"key":"9613_CR17","doi-asserted-by":"crossref","unstructured":"D. E. Knuth, \u201cThe sandwich theorem,\u201d Electron. J. Combin., 1, Article 1 (1994).","DOI":"10.37236\/1193"},{"issue":"2","key":"9613_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz, \u201cOn the Shannon capacity of a graph,\u201d IEEE Trans. Inform. Theory, 25, No. 2, 1\u20137 (1979).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9613_CR19","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(95)00042-9","volume":"18","author":"CJ Luz","year":"1995","unstructured":"C. J. Luz, \u201cAn upper bound on the independence number of a graph computable in polynomial time,\u201d Oper. Res. Lett., 18, 139\u2013145 (1995).","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9613_CR20","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/S0895480104429181","volume":"19","author":"CJ Luz","year":"2005","unstructured":"C. J. Luz and A. Schrijver, \u201cA convex quadratic characterization of the Lov\u00e1sz theta number,\u201d SIAM J. Discrete Math., 19, No. 2, 382\u2013387 (2005).","journal-title":"SIAM J. Discrete Math."},{"key":"9613_CR21","unstructured":"E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall (1977)."},{"issue":"2\u20133","key":"9613_CR22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10589-005-3060-5","volume":"33","author":"EA Yildirim","year":"2006","unstructured":"E. A. Yildirim and X. Fan, \u201cOn extracting maximum stable sets in perfect graphs using Lov\u00e1sz\u2019s theta function,\u201d Comput. Optim. Appl., 33, Nos. 2\u20133, 229\u2013247 (2006).","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Mathematical Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10958-009-9613-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10958-009-9613-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10958-009-9613-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T02:16:59Z","timestamp":1590113819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10958-009-9613-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9613"],"URL":"https:\/\/doi.org\/10.1007\/s10958-009-9613-x","relation":{},"ISSN":["1072-3374","1573-8795"],"issn-type":[{"value":"1072-3374","type":"print"},{"value":"1573-8795","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}