{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T23:47:58Z","timestamp":1778629678208,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T00:00:00Z","timestamp":1578873600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2014-59179-C2-1-P"],"award-info":[{"award-number":["MTM2014-59179-C2-1-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["RYC-2013-13327"],"award-info":[{"award-number":["RYC-2013-13327"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["BES-2015-073360"],"award-info":[{"award-number":["BES-2015-073360"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"award-info":[{"award-number":["PGC2018-097960-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s10898-019-00867-x","type":"journal-article","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T06:02:41Z","timestamp":1578895361000},"page":"383-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An enhanced formulation for solving graph coloring problems with the Douglas\u2013Rachford algorithm"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2445-8011","authenticated-orcid":false,"given":"Francisco J.","family":"Arag\u00f3n\u00a0Artacho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rub\u00e9n","family":"Campoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veit","family":"Elser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,13]]},"reference":[{"key":"867_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1002\/(SICI)1098-2418(1999010)14:1<63::AID-RSA3>3.0.CO;2-7","volume":"14","author":"D Achlioptas","year":"1999","unstructured":"Achlioptas, D., Friedgut, E.: A sharp threshold for $$k$$-colorability. Random Struct. Algorithm 14, 63\u201370 (1999)","journal-title":"Random Struct. Algorithm"},{"issue":"1","key":"867_CR2","doi-asserted-by":"publisher","first-page":"R29","DOI":"10.37236\/1461","volume":"6","author":"D Achlioptas","year":"1999","unstructured":"Achlioptas, D., Molloy, M.: Almost all graphs with $$2.522n$$ edges are not 3-colorable. Electron. J. Comb. 6(1), R29 (1999)","journal-title":"Electron. J. Comb."},{"issue":"1\u20132","key":"867_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-013-0707-3","volume":"148","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Mart\u00edn-M\u00e1rquez, V., Yao, L.: Applications of convex analysis within mathematics. Math. Program. Ser. B 148(1\u20132), 49\u201388 (2014)","journal-title":"Math. Program. Ser. B"},{"issue":"4","key":"867_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S1446181114000145","volume":"55","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Douglas\u2013Rachford feasibility methods for matrix completion problems. ANZIAM J. 55(4), 299\u2013326 (2014)","journal-title":"ANZIAM J."},{"issue":"1","key":"867_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-013-0488-0","volume":"163","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Recent results on Douglas\u2013Rachford methods for combinatorial optimization problem. J. Optim. Theory Appl. 163(1), 1\u201330 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"867_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10898-015-0380-6","volume":"65","author":"FJ Arag\u00f3n Artacho","year":"2016","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Global behavior of the Douglas\u2013Rachford method for a nonconvex feasibility problem. J. Glob. Optim. 65(2), 309\u2013327 (2016)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"867_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11228-017-0461-4","volume":"26","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R.: Solving graph coloring problems with the Douglas\u2013Rachford algorithm. Set Valued Var. Anal. 26(2), 277\u2013304 (2018)","journal-title":"Set Valued Var. Anal."},{"issue":"1","key":"867_CR8","first-page":"1","volume":"4","author":"JB Baillon","year":"1978","unstructured":"Baillon, J.B., Bruck, R.E., Reich, S.: On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces. Houst. J. Math. 4(1), 1\u20139 (1978)","journal-title":"Houst. J. Math."},{"key":"867_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"key":"867_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/636\/12726","volume":"636","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Koch, V.R.: Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces. Contemp. Math. 636, 1\u201340 (2015)","journal-title":"Contemp. Math."},{"issue":"6","key":"867_CR11","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00013-014-0652-2","volume":"102","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Noll, D.: On the local convergence of the Douglas\u2013Rachford algorithm. Arch. Math. 102(6), 589\u2013600 (2014)","journal-title":"Arch. Math."},{"issue":"2","key":"867_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10898-015-0296-1","volume":"63","author":"J Benoist","year":"2015","unstructured":"Benoist, J.: The Douglas\u2013Rachford algorithm for the case of the sphere and the line. J. Glob. Optim. 63(2), 363\u2013380 (2015)","journal-title":"J. Glob. Optim."},{"key":"867_CR13","doi-asserted-by":"crossref","unstructured":"Cegielski, A.: Iterative methods for fixed point problems in Hilbert spaces. Lecture Notes in Mathematics, vol. 2057. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-30901-4"},{"issue":"4","key":"867_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/989393.989403","volume":"39","author":"GJ Chaitin","year":"2004","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring. SIGPLAN Not. 39(4), 66\u201374 (2004)","journal-title":"SIGPLAN Not."},{"issue":"2","key":"867_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. Ser. A 91(2), 201\u2013213 (2002)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"867_CR16","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1073\/pnas.0606359104","volume":"104","author":"V Elser","year":"2007","unstructured":"Elser, V., Rankenburg, I., Thibault, P.: Searching with iterated maps. Proc. Natl. Acad. Sci. 104(2), 418\u2013423 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"867_CR17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. Debr. 6, 290\u2013297 (1959)","journal-title":"Publ. Math. Debr."},{"issue":"3","key":"867_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2478\/v10209-011-0012-y","volume":"37","author":"P Formanowicz","year":"2012","unstructured":"Formanowicz, P., Tana\u015b, K.: A survey of graph coloring\u2014its types, methods and applications. Found. Comput. Decis. Sci. 37(3), 223\u2013238 (2012)","journal-title":"Found. Comput. Decis. Sci."},{"issue":"10","key":"867_CR19","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"23","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., So, H.C.: An application of graph coloring to printed circuit testing. IEEE Trans. Circuits Syst. 23(10), 591\u2013599 (1976)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"12","key":"867_CR20","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"issue":"4","key":"867_CR21","doi-asserted-by":"publisher","first-page":"2397","DOI":"10.1137\/120902653","volume":"23","author":"R Hesse","year":"2013","unstructured":"Hesse, R., Luke, D.R.: Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems. SIAM J. Optim. 23(4), 2397\u20132419 (2013)","journal-title":"SIAM J. Optim."},{"key":"867_CR22","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge (2013)","edition":"2"},{"issue":"1","key":"867_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-016-0889-y","volume":"169","author":"AF Izmailov","year":"2016","unstructured":"Izmailov, A.F., Solodov, M.V., Uskov, E.T.: Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function. J. Optim. Theory Appl. 169(1), 1\u201331 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"867_CR24","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)"},{"key":"867_CR25","unstructured":"Johansson, F: mpmath, version 1.0 (2017). http:\/\/mpmath.org"},{"issue":"2","key":"867_CR26","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"D Karger","year":"1998","unstructured":"Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. J. ACM (JACM) 45(2), 246\u2013265 (1998)","journal-title":"J. ACM (JACM)"},{"key":"867_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"6","key":"867_CR28","doi-asserted-by":"publisher","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph coloring algorithm for large scheduling problems. J. Res. Natl. Bur. Stand. 84(6), 489\u2013506 (1979)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"867_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25730-3","volume-title":"A Guide to Graph Colouring: Algorithms and Applications","author":"RMR Lewis","year":"2016","unstructured":"Lewis, R.M.R.: A Guide to Graph Colouring: Algorithms and Applications. Springer, New York (2016)"},{"key":"867_CR30","unstructured":"OEIS Foundation Inc.: The on-line encyclopedia of integer sequences (2018). https:\/\/oeis.org\/A088202"},{"key":"867_CR31","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1007\/978-1-4613-0303-9_16","volume-title":"Handbook of Combinatorial Optimization","author":"PM Pardalos","year":"1998","unstructured":"Pardalos, P.M., Mavridou, T., Xue, J.: The graph coloring problem: a bibliographic survey. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1077\u20131141. Springer, New York (1998)"},{"issue":"2","key":"867_CR32","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1080\/02331934.2015.1051532","volume":"65","author":"HM Phan","year":"2016","unstructured":"Phan, H.M.: Linear convergence of the Douglas\u2013Rachford method for two closed sets. Optimization 65(2), 369\u2013385 (2016)","journal-title":"Optimization"},{"key":"867_CR33","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G Pierra","year":"1984","unstructured":"Pierra, G.: Decomposition through formalization in a product space. Math. Program. 28, 96\u2013115 (1984)","journal-title":"Math. Program."},{"issue":"2","key":"867_CR34","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/j.jmaa.2016.10.040","volume":"447","author":"MK Tam","year":"2017","unstructured":"Tam, M.K.: Regularity properties of non-negative sparsity sets. J. Math. Anal. Appl. 447(2), 758\u2013777 (2017)","journal-title":"J. Math. Anal. Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00867-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00867-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00867-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:46:19Z","timestamp":1695602779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00867-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,13]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["867"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00867-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,13]]},"assertion":[{"value":"17 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}