{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:19:43Z","timestamp":1760645983369},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T00:00:00Z","timestamp":1352937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10100-012-0276-1","type":"journal-article","created":{"date-parts":[[2012,11,14]],"date-time":"2012-11-14T00:10:57Z","timestamp":1352851857000},"page":"13-25","source":"Crossref","is-referenced-by-count":8,"title":["New heuristics for the vertex coloring problem based on semidefinite programming"],"prefix":"10.1007","volume":"21","author":[{"given":"Jelena","family":"Govor\u010din","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neboj\u0161a","family":"Gvozdenovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"Povh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,15]]},"reference":[{"key":"276_CR1","doi-asserted-by":"crossref","unstructured":"Arora S, Chlamtac E (2006) New approximation guarantee for chromatic number. In: Proceedings of the thirty-eighth annual ACM symposium on theory of computing, STOC \u201906, pp 215\u2013224. ACM, New York, NY, USA. doi: 10.1145\/1132516.1132548","DOI":"10.1145\/1132516.1132548"},{"key":"276_CR2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10107-006-0026-z","volume":"109","author":"I Dukanovic","year":"2007","unstructured":"Dukanovic I, Rendl F (2007) Semidefinite programming relaxations for graph coloring and maximal clique problems. Math Program 109:345\u2013365","journal-title":"Math Program"},{"issue":"2","key":"276_CR3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.dam.2006.07.014","volume":"156","author":"I Dukanovic","year":"2008","unstructured":"Dukanovic I, Rendl F (2008) A semidefinite programming-based heuristic for graph coloring. Discret Appl Math 156(2):180\u2013189","journal-title":"Discret Appl Math"},{"key":"276_CR4","doi-asserted-by":"crossref","unstructured":"Gvozdenovi\u0107 N, Laurent M (2008) Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization. SIAM J Optim 19(2):592\u2013615. doi: 10.1137\/070683520","DOI":"10.1137\/070683520"},{"key":"276_CR5","doi-asserted-by":"crossref","unstructured":"Gvozdenovi\u0107 N, Laurent M, Vallentin F (2009) Block-diagonal semidefinite programming hierarchies for 0\/1 programming. Oper Res Lett 37(1):27\u201331. doi: 10.1016\/j.orl.2008.10.003","DOI":"10.1016\/j.orl.2008.10.003"},{"key":"276_CR6","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"D Karger","year":"1998","unstructured":"Karger D, Motwani R, Sudan M (1998) Approximate graph coloring by semidefinite programming. J Assoc Comput Mach 45:246\u2013265","journal-title":"J Assoc Comput Mach"},{"key":"276_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L (1979) On the shannon capacity of a graph. IEEE Trans Inf Theory 25:1\u20137","journal-title":"IEEE Trans Inf Theory"},{"key":"276_CR8","doi-asserted-by":"crossref","unstructured":"Malick J, Povh J, Rendl F, Wiegele A (2009) Regularization methods for semidefinite programming. SIAM J Optim 20(1):336\u2013356. doi: 10.1137\/070704575","DOI":"10.1137\/070704575"},{"key":"276_CR9","doi-asserted-by":"crossref","unstructured":"Povh J, Rendl F (2009) Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optim 6(3):231\u2013241. doi: 10.1016\/j.disopt.2009.01.002","DOI":"10.1016\/j.disopt.2009.01.002"},{"key":"276_CR10","doi-asserted-by":"crossref","unstructured":"Povh J, Rendl F, Wiegele A (2006) A boundary point method to solve semidefinite programs. Computing 78(3):277\u2013286. doi: 10.1007\/s00607-006-0182-2","DOI":"10.1007\/s00607-006-0182-2"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-012-0276-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-012-0276-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-012-0276-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:30Z","timestamp":1559108970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-012-0276-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,15]]},"references-count":10,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s10100-012-0276-1","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,15]]}}}