{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:38:06Z","timestamp":1759667886003},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,3,13]],"date-time":"2014-03-13T00:00:00Z","timestamp":1394668800000},"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":[[2015,12]]},"DOI":"10.1007\/s10100-014-0345-8","type":"journal-article","created":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T09:40:12Z","timestamp":1394617212000},"page":"833-848","source":"Crossref","is-referenced-by-count":3,"title":["Circular coloring of graphs via linear programming and tabu search"],"prefix":"10.1007","volume":"23","author":[{"given":"Mate","family":"Barany","sequence":"first","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,13]]},"reference":[{"key":"345_CR1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/1562764.1562783","volume":"52","author":"K Asanovic","year":"2009","unstructured":"Asanovic K et al (2009) A view of the parallel computing landscape. Commun ACM 52:56\u201367","journal-title":"Commun ACM"},{"key":"345_CR2","doi-asserted-by":"crossref","unstructured":"Brandes U, Eiglsperger M, Herman I, Himsolt M, Marshall MS (2002) GraphML progress report structural layer proposal. In: Mutzel P, Junger M, Leipert S (eds) Graph drawing. Springer, Berlin, Heidelberg, pp 501\u2013512","DOI":"10.1007\/3-540-45848-4_59"},{"key":"345_CR3","unstructured":"Coin-OR Cbc. https:\/\/projects.coin-or.org\/Cbc"},{"key":"345_CR4","unstructured":"Webpage of Brendan McKay. http:\/\/cs.anu.edu.au\/bdm\/data\/graphs.html"},{"key":"345_CR5","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum L, Menon R (1998) OpenMP: an industry standard API for shared-memory programming. IEEE Comput Sci Eng 5:46\u201355","journal-title":"IEEE Comput Sci Eng"},{"key":"345_CR6","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/(SICI)1097-0118(199612)23:4<365::AID-JGT6>3.0.CO;2-P","volume":"23","author":"W Deuber","year":"1996","unstructured":"Deuber W, Zhu X (1996) Circular coloring of weighted graphs. J Graph Theor 23:365\u2013376","journal-title":"J Graph Theor"},{"key":"345_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"AT Ernst","year":"2004","unstructured":"Ernst AT, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153:3\u201327","journal-title":"Eur J Oper Res"},{"key":"345_CR8","unstructured":"Ghebleh M (2007) Theorems and computations in circular colourings of graphs. PhD Thesis, Simon Fraser University"},{"key":"345_CR9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1:190\u2013206","journal-title":"ORSA J Comput"},{"key":"345_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search\u2014part II. ORSA J Comput 2:4\u201332","journal-title":"ORSA J Comput"},{"key":"345_CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/jgt.3190170202","volume":"17","author":"DR Guichard","year":"1993","unstructured":"Guichard DR (1993) Acyclic graph coloring and the complexity of the star chromatic number. J Graph Theor 17:129\u2013134","journal-title":"J Graph Theor"},{"key":"345_CR12","doi-asserted-by":"crossref","unstructured":"Hatami H, Tusserkani R (2004) On the complexity of the circular chromatic number. J Graph Theor 47: 226\u2013230","DOI":"10.1002\/jgt.20022"},{"key":"345_CR13","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz A, Werra D (1987) Using tabu search techniques for graph coloring. Computing 39:345\u2013351","journal-title":"Computing"},{"key":"345_CR14","first-page":"199","volume":"169","author":"A Kemnitz","year":"2004","unstructured":"Kemnitz A, Wellmann P (2004) Circular chromatic numbers of certain planar graphs and small graphs. Congr Numer 169:199\u2013209","journal-title":"Congr Numer"},{"key":"345_CR15","doi-asserted-by":"crossref","unstructured":"Kubale M (2004) Graph colorings. American Mathematical Society, Providence, Rhode Island","DOI":"10.1090\/conm\/352"},{"key":"345_CR16","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/j.cie.2010.03.013","volume":"59","author":"E Levner","year":"2010","unstructured":"Levner E, Kats V, de Pablo D, Cheng TCE (2010) Complexity of cyclic scheduling problems: a state-of-the-art survey. Comput Ind Eng 59:352\u2013361","journal-title":"Comput Ind Eng"},{"key":"345_CR17","doi-asserted-by":"crossref","unstructured":"Maros I (2003) Computational techniques of the simplex method. Kluwer Academic Publishers, Boston","DOI":"10.1007\/978-1-4615-0257-9"},{"key":"345_CR18","first-page":"11","volume":"48","author":"D Marx","year":"2004","unstructured":"Marx D (2004) Graph colouring problems and their applications in scheduling. Period Polytech Ser El Eng 48:11\u201316","journal-title":"Period Polytech Ser El Eng"},{"key":"345_CR19","first-page":"652","volume":"15","author":"M Modarres","year":"2008","unstructured":"Modarres M, Ghandehari M (2008) Applying circular coloring to open shop scheduling. Sci Iran 15:652\u2013660","journal-title":"Sci Iran"},{"key":"345_CR20","unstructured":"Pardalos PM, Mavridou T, Xue J (1999) The graph coloring problem: a bibliographic survey. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization. Springer, US, pp 1077\u20131141"},{"key":"345_CR21","unstructured":"Pinedo M (2005) Planning and scheduling in manufacturing and services, vol 24. Springer, New York"},{"key":"345_CR22","unstructured":"Randall, M., Abramson, D.: (1999) A general parallel tabu search algorithm for combinatorial optimisation problems. In: Proceedings of 1999 parallel and real time conference, Melbourne, pp 68\u201379"},{"key":"345_CR23","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.ejor.2004.03.001","volume":"163","author":"H Stadtler","year":"2005","unstructured":"Stadtler H (2005) Supply chain management and advanced planning\u2014basics, overview and challenges. Eur J Oper Res 163:575\u2013588","journal-title":"Eur J Oper Res"},{"key":"345_CR24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(92)90322-7","volume":"103","author":"M Truszczy\u0144ski","year":"1992","unstructured":"Truszczy\u0144ski M, Zs Tuza (1992) Rado\u2019s selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets. Discret Math 103:301\u2013312","journal-title":"Discret Math"},{"key":"345_CR25","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1002\/jgt.3190120411","volume":"12","author":"A Vince","year":"1988","unstructured":"Vince A (1988) Star chromatic number. J Graph Theor 12:551\u2013559","journal-title":"J Graph Theor"},{"key":"345_CR26","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/j.tcs.2004.12.005","volume":"332","author":"HG Yeh","year":"2005","unstructured":"Yeh HG, Zhu X (2005) Resource-sharing system scheduling and circular chromatic number. Theor Comput Sci 332:447\u2013460","journal-title":"Theor Comput Sci"},{"key":"345_CR27","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1002\/jgt.3190160604","volume":"16","author":"X Zhu","year":"1992","unstructured":"Zhu X (1992) Star chromatic numbers and products of graphs. J Graph Theor 16:557\u2013569","journal-title":"J Graph Theor"},{"key":"345_CR28","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0012-365X(00)00217-X","volume":"229","author":"X Zhu","year":"2001","unstructured":"Zhu X (2001) Circular chromatic number: a survey. Discret Math 229:371\u2013410","journal-title":"Discret Math"},{"key":"345_CR29","doi-asserted-by":"crossref","unstructured":"Zhu X, Thomas R (2006) Recent developments in circular colouring of graphs. In: Klazar M, Kratochvil J, Loebl M, Thomas R, Valtr P (eds) Topics in discrete mathematics. Springer, Berlin, Heidelberg, pp 497\u2013550","DOI":"10.1007\/3-540-33700-8_25"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0345-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0345-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0345-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:32Z","timestamp":1559108972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0345-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,13]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["345"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0345-8","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,13]]}}}