{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:03Z","timestamp":1752378003029,"version":"3.41.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1023\/a:1018370201421","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"53-64","source":"Crossref","is-referenced-by-count":10,"title":["Solving the Minimum Weighted Integer Coloring Problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Jue","family":"Xue","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"168457_CR1","unstructured":"L. Babel, \u201cHeuristic coloring of weighted graphs and the maximum weight clique problem,\u201d Technical Report, TUM-M9107, Technische Universitat Munchen, 1991"},{"key":"168457_CR2","doi-asserted-by":"crossref","unstructured":"E. Balas and J. Xue, \u201cWeighted and unweighted maximum clique algorithms with upper bounds from fractional coloring,\u201d Algorithmica, pp. 1\u201316, 1995","DOI":"10.1007\/s004539900022"},{"key":"168457_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0196-6774(85)90044-6","volume":"6","author":"E. Bender","year":"1985","unstructured":"E. Bender and H.S. Wilf, \u201cA Theoretical Analysis of Backtracking in the Graph Coloring Problem,\u201d J. of Algorithms, vol. 6, pp. 275\u2013282, 1985","journal-title":"J. of Algorithms"},{"key":"168457_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"D. Brelaz, \u201cNew methods to color the vertices of a graph,\u201d Comm. of ACM, vol. 22, pp. 251\u2013256, 1979","journal-title":"Comm. of ACM"},{"key":"168457_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/0377-2217(91)90254-S","volume":"51","author":"M. Cangalovic","year":"1991","unstructured":"M. Cangalovic and J. Schreuder, \u201cExact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths,\u201d EJOR, vol. 51, pp. 248\u2013258, 1991","journal-title":"EJOR"},{"key":"168457_CR6","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M. Chams","year":"1987","unstructured":"M. Chams, A. Hertz, and D. de Werra, \u201cSome experiments with simulated annealing for coloring graphs,\u201d EJOR, vol. 32, pp. 260\u2013266, 1987","journal-title":"EJOR"},{"key":"168457_CR7","series-title":"Technical Report","volume-title":"Iterated Greedy Graph Coloring and the Difficulty Landscape","author":"J. C. Culberson","year":"1992","unstructured":"J. C. Culberson, Iterated Greedy Graph Coloring and the Difficulty Landscape, Technical Report TR 92-07, Dept. of Comput. Sci., The Univ. of Alberta, Edmonton, Alberta, Canada, 1992"},{"key":"168457_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. de Werra","year":"1985","unstructured":"D. de Werra, \u201cAn introduction to timetabling,\u201d EJOR, vol. 19, pp. 151\u2013162, 1985","journal-title":"EJOR"},{"key":"168457_CR9","first-page":"191","volume":"Suppl.7","author":"D. de Werra","year":"1990","unstructured":"D. de Werra, \u201cHeuristics for Graph Coloring,\u201d Computing, Suppl. 7, pp. 191\u2013208, 1990","journal-title":"Computing"},{"key":"168457_CR10","volume-title":"A guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability, A guide to the Theory of NP-Completeness, FREEMAN: San Francisco, 1979"},{"key":"168457_CR11","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","volume":"23","author":"M. Garey","year":"1976","unstructured":"M. Garey, D. Johnson, and H.G. So, \u201cAn application of graph coloring to printed circuit testing,\u201d EEE Trans. on Circuits and Syst., vol. 23, pp. 591\u2013598, 1976","journal-title":"EEE Trans. on Circuits and Syst."},{"key":"168457_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, \u201cThe Ellipsoid Method and Its Consequences in Combinatorial Optimization,\u201d Combinatorica, vol. 1, pp. 169\u2013197, 1981.","journal-title":"Combinatorica"},{"key":"168457_CR13","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/01621459.1978.10481589","volume":"73","author":"P. Hansen","year":"1978","unstructured":"P. Hansen and M. Delattre, \u201cComplete-link cluster analysis by graph coloring,\u201d J. of the American Statistical Association, vol. 73, pp. 397\u2013403, 1978","journal-title":"J. of the American Statistical Association"},{"key":"168457_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"A. Hertz and D. de Werra, \u201cUsing tabu search techniques for graph coloring,\u201d Computing, vol. 39, pp. 345\u2013351, 1987","journal-title":"Computing"},{"key":"168457_CR15","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/3341.3350","volume":"28","author":"M. Kubale","year":"1985","unstructured":"M. Kubale and B. Jackowski, \u201cA generalized Implicit enumeration algorithm for graph coloring,\u201d Comm. of ACM, vol. 28, pp. 412\u2013418, 1985","journal-title":"Comm. of ACM"},{"key":"168457_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D. W. Matula","year":"1983","unstructured":"D. W. Matula and L. L. Beck, \u201cSmallest-last ordering and clustering and graph coloring algorithms,\u201d J. of ACM, vol. 30, pp. 417\u2013427, 1983","journal-title":"J. of ACM"},{"key":"168457_CR17","first-page":"108","volume-title":"Graph Theory and Computing","author":"D. W. Matula","year":"1972","unstructured":"D. W. Matula, G. Marble and J. D. Isaacson, Graph coloring algorithms, in: R. C. Read, ed. Graph Theory and Computing, pp. 108\u2013122, Academic Press, New York, 1972"},{"key":"168457_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01299447","volume":"3","author":"C. Mannino","year":"1994","unstructured":"C. Mannino and A. Sassano, \u201cAn exact algorithm for the maximum stable set problem,\u201d Comput. Opt. and Appl., vol. 3, pp. 243\u2013258, 1994","journal-title":"Comput. Opt. and Appl."},{"key":"168457_CR19","first-page":"76","volume-title":"Res. Notes in Math.","author":"C. McDiarmid","year":"1979","unstructured":"C. McDiarmid, Res. Notes in Math., vol. 34, pp. 76\u201386, Pitman: San Francisco, Calif., 1979"},{"key":"168457_CR20","series-title":"Technical Report","volume-title":"A column generation approach for graph coloring","author":"A. Mehrotra","year":"1995","unstructured":"A. Mehrotra and M. Trick, A column generation approach for graph coloring, Technical Report, GSIA, Carnegie Mellon Univ. Pittsburgh, PA 15213, 1995"},{"key":"168457_CR21","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/inte.11.5.57","volume":"11","author":"N. Mehta","year":"1981","unstructured":"N. Mehta, \u201cThe application of a graph coloring method to an examination scheduling problem,\u201d Interfaces, vol. 11, pp. 57\u201364, 1981","journal-title":"Interfaces"},{"key":"168457_CR22","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/00207218908921070","volume":"67","author":"S. S. Sarma","year":"1989","unstructured":"S. S. Sarma and S. K. Bandyopadhyay, \u201cSome sequential graph colouring algorithms,\u201d ntern. J. of Electronics, vol. 67, pp. 187\u2013199, 1989","journal-title":"J. of Electronics"},{"key":"168457_CR23","volume-title":"Discrete optimization algorithms with PASCAL programs","author":"M. M. Syslo","year":"1983","unstructured":"M. M. Syslo, N. Deo, and J. S. Kowalik, Discrete optimization algorithms with PASCAL programs, Prentice-Hall: Englewood Cliffs, N.J. 1983"},{"key":"168457_CR24","doi-asserted-by":"crossref","unstructured":"R. Venkatesan and L. A. Levin, \u201cRandom Instances of a Graph Coloring Problem are Hard,\u201d J. ACM, pp. 217\u2013222, 1988","DOI":"10.1145\/62212.62231"},{"key":"168457_CR25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D. J. Welsh","year":"1967","unstructured":"D. J. Welsh, M. B. Powell, \u201cAn upper bound on the chromatic number of a graph and its application to timetabling problems,\u201d Computer J., vol. 10, pp. 85\u201387, 1967","journal-title":"Computer J."},{"key":"168457_CR26","volume-title":"Algorithms and Complexity","author":"H.S. Wilf","year":"1986","unstructured":"H.S. Wilf, Algorithms and Complexity, Prentice-Hall: Englewood Cliffs, N.J. 1986"},{"key":"168457_CR27","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230240208","volume":"24","author":"J. Xue","year":"1994","unstructured":"J. Xue, \u201cEdge-Maximal triangulated subgraphs and heuristics for the maximum clique problem,\u201d NETWORKS, vol. 24, pp. 109\u2013120, 1994","journal-title":"NETWORKS"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018370201421.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018370201421\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018370201421.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:12:37Z","timestamp":1752376357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018370201421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["168457"],"URL":"https:\/\/doi.org\/10.1023\/a:1018370201421","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}