{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:10:17Z","timestamp":1777540217805,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10898-005-5185-6","type":"journal-article","created":{"date-parts":[[2006,7,8]],"date-time":"2006-07-08T10:19:33Z","timestamp":1152353973000},"page":"405-421","source":"Crossref","is-referenced-by-count":6,"title":["On a Polynomial Fractional Formulation for Independence Number of a Graph"],"prefix":"10.1007","volume":"35","author":[{"given":"Balabhaskar","family":"Balasundaram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5185_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1011968411281","volume":"21","author":"J. Abello","year":"2001","journal-title":"Journal of Global Optimization"},{"key":"5185_CR2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1080\/10556780500139641","volume":"20","author":"B. Balasundaram","year":"2005","journal-title":"Optimization Methods and Software"},{"key":"5185_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008230200610","volume":"10","author":"I.M. Bomze","year":"1997","journal-title":"Journal of Global Optimization"},{"key":"5185_CR4","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"},{"key":"5185_CR5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2001","journal-title":"SIAM Journal on Optimization"},{"key":"5185_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10107-002-0356-4","volume":"94","author":"S. Burer","year":"2002","journal-title":"Mathematical Programming"},{"key":"5185_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1014899909753","volume":"6","author":"S. Busygin","year":"2002","journal-title":"Journal of Combinatorial Optimization"},{"key":"5185_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190150110","volume":"15","author":"Y. Caro","year":"1991","journal-title":"Journal of Graph Theory"},{"key":"5185_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/B:JOGO.0000006654.34226.fe","volume":"28","author":"P.L. Angelis de","year":"2004","journal-title":"Journal of Global Optimization"},{"key":"5185_CR10","unstructured":"DIMACS (1995), Cliques, coloring, and satisfiability: second DIMACS implementation challenge, http:\/\/dimacs.rutgers.edu\/Challenges\/. Accessed August 2004."},{"key":"5185_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979"},{"key":"5185_CR12","doi-asserted-by":"crossref","unstructured":"Gibbons, L.E., Hearn, D.W. and Pardalos, P.M. (1996), A continuous based heuristic for the maximum clique problem, In: Johnson, D.S. and Trick, M.A. (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Vol. 26 of DIMACS Series, American Mathematical Society, Providence, RI, pp. 103\u2013124.","DOI":"10.1090\/dimacs\/026\/07"},{"key":"5185_CR13","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"L.E. Gibbons","year":"1997","journal-title":"Mathematics of Operations Research"},{"key":"5185_CR14","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","journal-title":"Journal of ACM"},{"key":"5185_CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(98)00048-X","volume":"188","author":"J. Harant","year":"1998","journal-title":"Discrete Mathematics"},{"key":"5185_CR16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.7151\/dmgt.1107","volume":"20","author":"J. Harant","year":"2000","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"5185_CR17","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1017\/S0963548399004034","volume":"8","author":"J. Harant","year":"1999","journal-title":"Combinatorics, Probability and Computing"},{"key":"5185_CR18","unstructured":"MathWorks (2004), The mathworks Matlab \u00ae optimization toolbox \u2013 fmincon, http:\/\/www.mathworks.com\/access\/helpdesk\/help\/toolbox\/optim\/fmincon.html. Accessed August 2004."},{"key":"5185_CR19","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","journal-title":"Canadian Journal of Mathematics"},{"key":"5185_CR20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4899-0289-4_22","volume-title":"Nonlinear Optimization and Applications","author":"P. Pardalos","year":"1996"},{"key":"5185_CR21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1023\/B:JOGO.0000035016.74398.e6","volume":"29","author":"H. Tuy","year":"2004","journal-title":"Journal of Global Optimization"},{"key":"5185_CR22","unstructured":"Wei, V.K. (1981), A lower bound on the stability number of a simple graph, Technical Report TM 81-11217-9, Bell Laboratories, Murray Hill, NJ."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-005-5185-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-005-5185-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-005-5185-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T08:12:04Z","timestamp":1559290324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-005-5185-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["5185"],"URL":"https:\/\/doi.org\/10.1007\/s10898-005-5185-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]}}}