{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:37:27Z","timestamp":1758271047056},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,2]],"date-time":"2011-06-02T00:00:00Z","timestamp":1306972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10732-011-9171-5","type":"journal-article","created":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T18:55:32Z","timestamp":1306954532000},"page":"629-644","source":"Crossref","is-referenced-by-count":7,"title":["On characterization of maximal independent sets via quadratic optimization"],"prefix":"10.1007","volume":"19","author":[{"given":"Foad","family":"Mahdavi\u00a0Pajouh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balabhaskar","family":"Balasundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,2]]},"reference":[{"key":"9171_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1011968411281","volume":"21","author":"J. Abello","year":"2001","unstructured":"Abello, J., Butenko, S., Pardalos, P., Resende, M.: Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21, 111\u2013137 (2001)","journal-title":"J. Glob. Optim."},{"key":"9171_CR2","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1991","unstructured":"Alon, N., Spencer, J.H., Erd\u00f6s, P.: The Probabilistic Method. Wiley, New York (1991)"},{"issue":"4\u20135","key":"9171_CR3","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1080\/10556780500139641","volume":"20","author":"B. Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S.: Constructing test functions for global optimization using continuous formulations of graph problems. J. Optim. Methods Softw. 20(4\u20135), 439\u2013452 (2005)","journal-title":"J. Optim. Methods Softw."},{"issue":"3","key":"9171_CR4","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10898-005-5185-6","volume":"35","author":"B. Balasundaram","year":"2006","unstructured":"Balasundaram, B., Butenko, S.: On a polynomial fractional formulation for independence number of a graph. J. Glob. Optim. 35(3), 405\u2013421 (2006)","journal-title":"J. Glob. Optim."},{"issue":"1\u20133","key":"9171_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M., Reinelt, G.: Experiments in quadratic 0-1 programming. Math. Program. 44(1\u20133), 127\u2013137 (1989)","journal-title":"Math. Program."},{"issue":"1","key":"9171_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/S1052623498336930","volume":"11","author":"A. Beck","year":"2000","unstructured":"Beck, A., Teboulle, M.: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11(1), 179\u2013188 (2000)","journal-title":"SIAM J. Optim."},{"key":"9171_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"I.M. Bomze","year":"1997","unstructured":"Bomze, I.M.: Evolution towards the maximum clique. J. Glob. Optim. 10, 143\u2013164 (1997)","journal-title":"J. Glob. Optim."},{"key":"9171_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1\u201374. Kluwer Academic, Dordrecht (1999)"},{"issue":"3","key":"9171_CR9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E. Boros","year":"1991","unstructured":"Boros, E., Hammer, P.L.: The max-cut problem and quadratic 0\u20131 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33(3), 151\u2013180 (1991)","journal-title":"Ann. Oper. Res."},{"key":"9171_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E. Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math. 123, 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9171_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10732-007-9009-3","volume":"13","author":"E. Boros","year":"2007","unstructured":"Boros, E., Hammer, P.L., Tavares, G.: Local search heuristics for quadratic unconstrained binary optimization. J. Heuristics 13(2), 99\u2013132 (2007)","journal-title":"J. Heuristics"},{"issue":"2","key":"9171_CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10898-009-9416-0","volume":"46","author":"W. Chen","year":"2010","unstructured":"Chen, W., Zhang, L.: Global optimality conditions for quadratic 0-1 optimization problems. J. Glob. Optim. 46(2), 191\u2013206 (2010)","journal-title":"J. Glob. Optim."},{"key":"9171_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/B:JOGO.0000006654.34226.fe","volume":"28","author":"P.L. Angelis de","year":"2004","unstructured":"de Angelis, P.L., Bomze, I.M., Toraldo, G.: Ellipsoidal approach to box-constrained quadratic problems. J. Glob. Optim. 28, 1\u201315 (2004)","journal-title":"J. Glob. Optim."},{"key":"9171_CR14","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (1997)"},{"key":"9171_CR15","unstructured":"Dimacs: Cliques, coloring, and satisfiability: Second Dimacs implementation challenge (1995). Online: http:\/\/dimacs.rutgers.edu\/Challenges\/ . Accessed March 2007"},{"key":"9171_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"9171_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)"},{"key":"9171_CR18","author":"F. Glover","year":"2010","unstructured":"Glover, F., L\u00fc, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR (2010). doi: 10.1007\/s10288-009-0115-y","journal-title":"4OR"},{"key":"9171_CR19","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9171_CR20","doi-asserted-by":"crossref","first-page":"71","DOI":"10.7151\/dmgt.1107","volume":"20","author":"J. Harant","year":"2000","unstructured":"Harant, J.: Some news about the independence number of a graph. Discuss. Math., Graph Theory 20, 71\u201379 (2000)","journal-title":"Discuss. Math., Graph Theory"},{"issue":"3","key":"9171_CR21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01580072","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg, C., Rendl, F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Program. 82(3), 291\u2013315 (1998)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"9171_CR22","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10589-005-3062-3","volume":"33","author":"H.X. Huang","year":"2006","unstructured":"Huang, H.X., Pardalos, P.M., Prokopyev, O.A.: Lower bound improvement and forcing rule for quadratic binary programming. Comput. Optim. Appl. 33(2\u20133), 187\u2013208 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9171_CR23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"G. Kochenberger","year":"2005","unstructured":"Kochenberger, G., Glover, F., Alidaee, B., Rego, C.: An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann. Oper. Res. 139(1), 229\u2013241 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9171_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9171_CR25","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., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"key":"9171_CR26","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G. Palubeckis","year":"2004","unstructured":"Palubeckis, G.: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131, 259\u2013282 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9171_CR27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos, P.M., Rodgers, G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2), 131\u2013144 (1990)","journal-title":"Computing"},{"issue":"3","key":"9171_CR28","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P.M. Pardalos","year":"1992","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Glob. Optim. 4(3), 301\u2013328 (1992)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9171_CR29","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/10556780701550083","volume":"23","author":"P.M. Pardalos","year":"2008","unstructured":"Pardalos, P.M., Prokopyev, O.A., Shylo, O.V., Shylo, V.P.: Global equilibrium search applied to the unconstrained binary quadratic optimization problem. Optim. Methods Softw. 23(1), 129\u2013140 (2008)","journal-title":"Optim. Methods Softw."},{"key":"9171_CR30","unstructured":"Sloane, N.J.A.: Challenge problems: Independent sets in graphs (2000). Online: http:\/\/www.research.att.com\/~njas\/doc\/graphs.html . Accessed July 2003"},{"key":"9171_CR31","series-title":"Ohio State University Mathematical Research Institute Publications","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1515\/9783110198119.273","volume-title":"Codes and Designs","author":"N.J.A. Sloane","year":"2002","unstructured":"Sloane, N.J.A.: On single-deletion-correcting codes. In: Arasu, K.T., Seress, A. (eds.) Codes and Designs. Ohio State University Mathematical Research Institute Publications, vol. 10, pp. 273\u2013291. de Gruyter, Berlin (2002)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9171-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9171-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9171-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T04:57:30Z","timestamp":1686113850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9171-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,2]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9171"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9171-5","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,2]]}}}