{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:58:27Z","timestamp":1648630707144},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,3,3]],"date-time":"2017-03-03T00:00:00Z","timestamp":1488499200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Seed Fund RWTH Aachen Excellence Initiative"},{"name":"German Federal Ministry of Education and Research","award":["05M13PAA","05M2013"],"award-info":[{"award-number":["05M13PAA","05M2013"]}]},{"name":"Undergraduate Funds of the Excellence Initiative"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10479-017-2451-1","type":"journal-article","created":{"date-parts":[[2017,3,3]],"date-time":"2017-03-03T01:58:51Z","timestamp":1488506331000},"page":"3-28","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A flow based pruning scheme for enumerative equitable coloring algorithms"],"prefix":"10.1007","volume":"272","author":[{"given":"A. M. C. A.","family":"Koster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Scheidweiler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Tieves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,3]]},"reference":[{"key":"2451_CR1","unstructured":"Ahuja, R. K., Magnati, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Upper Saddle River, NJ: Prentice-Hall, Inc."},{"key":"2451_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22, 251\u2013256.","journal-title":"Communications of the ACM"},{"key":"2451_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0012-365X(96)00208-7","volume":"165","author":"D Werra de","year":"1997","unstructured":"de Werra, D. (1997). Restricted coloring models for timetabling. Discrete Mathematics, 165, 161\u2013170.","journal-title":"Discrete Mathematics"},{"issue":"1","key":"2451_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0166-218X(99)00019-0","volume":"94","author":"D Werra de","year":"1999","unstructured":"de Werra, D. (1999). On a multiconstrained model for chromatic scheduling. Discrete Applied Mathematics, 94(1), 171\u2013180.","journal-title":"Discrete Applied Mathematics"},{"key":"2451_CR5","unstructured":"Goldberg, A. V. (1985). A new max-flow algorithm, Technical Report MIT\/LCS\/TM-291. Laboratory for Computer Science, Massachusetts Institute of Technology."},{"key":"2451_CR6","unstructured":"Hajnal, A., & Szemer\u00e9di, E. (1970). Proof of a conjecture. In P. Erd\u00f6s, A. R\u00e9nyi & V. T. S\u00f3s (Eds.), Combinatorial theory and its application (pp. 601\u2013623). London: North-Holland."},{"key":"2451_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1090\/psapm\/010\/0114759","volume":"10","author":"AJ Hoffman","year":"1960","unstructured":"Hoffman, A. J. (1960). Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proceedings of Symposia in Applied Mathematics, 10, 113\u2013127.","journal-title":"Proceedings of Symposia in Applied Mathematics"},{"issue":"2","key":"2451_CR8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00493-010-2483-5","volume":"30","author":"HA Kierstead","year":"2010","unstructured":"Kierstead, H. A., Kostochka, A. V., Mydlarz, M., & Szemer\u00e9di, E. (2010). A fast algorithm for equitable coloring. Combinatorica, 30(2), 217\u2013224.","journal-title":"Combinatorica"},{"key":"2451_CR9","doi-asserted-by":"crossref","unstructured":"Lih, K.-W. (2013). Equitable coloring of graphs. In P. M. Pardalos, D.-Z. Du & R. L. Graham (Eds.), Handbook of combinatorial optimization (pp. 1199\u20131248). New York: Springer.","DOI":"10.1007\/978-1-4419-7997-1_25"},{"key":"2451_CR10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.endm.2013.10.044","volume":"44","author":"I M\u00e9ndez-D\u00edaz","year":"2013","unstructured":"M\u00e9ndez-D\u00edaz, I., Nasini, G., & Sever\u00edn, D. (2013). An exact DSATUR-based algorithm for the equitable coloring problem. Electronic Notes in Discrete Mathematics, 44, 281\u2013286.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2451_CR11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.dam.2012.11.018","volume":"164(II)","author":"I M\u00e9ndez-D\u00edaz","year":"2014","unstructured":"M\u00e9ndez-D\u00edaz, I., Nasini, G., & Sever\u00edn, D. (2014a). A polyhedral approach for the equitable coloring problem. Discrete Applied Mathematics, 164(II), 413\u2013426.","journal-title":"Discrete Applied Mathematics"},{"key":"2451_CR12","first-page":"347","volume":"8596","author":"I M\u00e9ndez-D\u00edaz","year":"2014","unstructured":"M\u00e9ndez-D\u00edaz, I., Nasini, G., & Sever\u00edn, D. (2014b). A tabu search heuristic for the equitable coloring problem. LNCS, 8596, 347\u2013358.","journal-title":"LNCS"},{"key":"2451_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cor.2014.11.014","volume":"57","author":"I M\u00e9ndez-D\u00edaz","year":"2015","unstructured":"M\u00e9ndez-D\u00edaz, I., Nasini, G., & Sever\u00edn, D. (2015). A DSATUR-based algorithm for the equitable coloring problem. Computers & Operations Research, 57, 41\u201350.","journal-title":"Computers & Operations Research"},{"key":"2451_CR14","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1080\/00029890.1973.11993408","volume":"80","author":"W Meyer","year":"1973","unstructured":"Meyer, W. (1973). Equitable coloring. American Mathematical Monthly, 80, 920\u2013922.","journal-title":"American Mathematical Monthly"},{"key":"2451_CR15","unstructured":"Siek, J., Lee, L., & Lumsdaine, A. (2015). Boost Graph Library. \n                        http:\/\/www.boost.org\/libs\/graph\n                        \n                    ."},{"issue":"3","key":"2451_CR16","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1137\/1015072","volume":"15","author":"A Tucker","year":"1973","unstructured":"Tucker, A. (1973). Perfect graphs and an application to optimizing municipal services. SIAM Review, 15(3), 585\u2013590.","journal-title":"SIAM Review"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2451-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2451-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2451-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T06:55:53Z","timestamp":1546325753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2451-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,3]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["2451"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2451-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,3]]}}}