{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:44:56Z","timestamp":1774417496472,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T00:00:00Z","timestamp":1211932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10732-008-9075-1","type":"journal-article","created":{"date-parts":[[2008,5,27]],"date-time":"2008-05-27T09:12:33Z","timestamp":1211879553000},"page":"503-526","source":"Crossref","is-referenced-by-count":30,"title":["Models and heuristic algorithms for a weighted vertex coloring problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Enrico","family":"Malaguti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Monaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,28]]},"reference":[{"key":"9075_CR1","first-page":"874","volume":"40","author":"M. Boudhar","year":"2000","unstructured":"Boudhar, M., Finke, G.: Scheduling on a batch machine with job compatibilities. Belg. J. Oper. Res. Stat. Comput. Sci. 40, 874\u2013885 (2000)","journal-title":"Belg. J. Oper. Res. Stat. Comput. Sci."},{"key":"9075_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.: New methods to color the vertices of a graph. Commun. ACM 22, 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"key":"9075_CR3","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Oper. Res. 47, 730\u2013743 (1999)","journal-title":"Oper. Res."},{"key":"9075_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02288323","volume":"13","author":"G. Carpaneto","year":"1988","unstructured":"Carpaneto, G., Martello, S., Toth, P.: Algorithms and codes for the assignment problem. Ann. Oper. Res. 13, 193\u2013223 (1988)","journal-title":"Ann. Oper. Res."},{"key":"9075_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10951-006-0003-7","volume":"10","author":"D. Werra De","year":"2007","unstructured":"De Werra, D., Demange, M., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. J. Sched. 10, 111\u2013127 (2007)","journal-title":"J. Sched."},{"key":"9075_CR6","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software, (Linpack Benchmark report). Technical Report CS-89-85, University of Tennessee, Computer Science Department (2006)"},{"key":"9075_CR7","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ipl.2005.09.013","volume":"94","author":"B. Escoffier","year":"2006","unstructured":"Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring: further complexity and approximability results. Inf. Process. Lett. 94, 98\u2013103 (2006)","journal-title":"Inf. Process. Lett."},{"key":"9075_CR8","unstructured":"Finke, G., Jost, V., Queyranne, M., Seb\u00f6, A.: Batch processing with interval graph compatibilities between tasks. Cahiers du laboratoire Leibniz 108 (2004)"},{"key":"9075_CR9","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Freedman, New York (1979)"},{"key":"9075_CR10","doi-asserted-by":"crossref","unstructured":"Gavranovich, H., Finke, G.: Graph partitioning and set covering for the optimal design of a production system in the metal industry. In: Proceedings of the Second Conference on Management and Control of Production and Logistics (MCPL\u20192000), vol. 2, pp. 603\u2013608, Grenoble, France (2000)","DOI":"10.1016\/S1474-6670(17)39472-7"},{"key":"9075_CR11","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 9, 849\u2013859 (1961)","journal-title":"Oper. Res."},{"key":"9075_CR12","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P.C. Gilmore","year":"1963","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem\u2014Part II. Oper. Res. 11, 863\u2013888 (1963)","journal-title":"Oper. Res."},{"key":"9075_CR13","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/opre.45.6.874","volume":"45","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S., Landy, D.: Scheduling semiconductor burn-in operations to minimize total flowtime. Oper. Res. 45, 874\u2013885 (1997)","journal-title":"Oper. Res."},{"key":"9075_CR14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"9075_CR15","volume-title":"Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challange, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science","year":"1996","unstructured":"Johnson, D.S., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability: 2nd DIMACS Implementation Challange, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence (1996)"},{"key":"9075_CR16","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; Part II, graph coloring and number partitioning. Oper. Res. 39, 378\u2013406 (1991)","journal-title":"Oper. Res."},{"key":"9075_CR17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/B:JOCO.0000038915.62826.79","volume":"8","author":"A. Lodi","year":"2004","unstructured":"Lodi, A., Martello, S., Vigo, D.: Models and bounds for two-dimensional level packing problems. J. Comb. Optim. 8, 363\u2013379 (2004)","journal-title":"J. Comb. Optim."},{"key":"9075_CR18","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/ijoc.1070.0245","volume":"20","author":"E. Malaguti","year":"2008","unstructured":"Malaguti, E., Monaci, M., Toth, P.: A\u00a0metaheuristic approach for the vertex coloring problem. INFORMS J. Comput. 20, 302\u2013316 (2008)","journal-title":"INFORMS J. Comput."},{"key":"9075_CR19","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS J. Comput. 8, 344\u2013354 (1996)","journal-title":"INFORMS J. Comput."},{"key":"9075_CR20","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M. Monaci","year":"2006","unstructured":"Monaci, M., Toth, P.: A set-covering based heuristic approach for bin-packing problems. INFORMS J. Comput. 18, 71\u201385 (2006)","journal-title":"INFORMS J. Comput."},{"key":"9075_CR21","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12, 164\u2013176 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9075_CR22","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0377-2217(89)90389-5","volume":"41","author":"C.C. Ribeiro","year":"1989","unstructured":"Ribeiro, C.C., Minoux, M., Penna, M.C.: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment. Eur. J. Oper. Res. 41, 232\u2013239 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"9075_CR23","unstructured":"Trick, M.A.: Computational symposium: Graph coloring and its generalizations. Cornell University, Ithaca, NY, 2002. http:\/\/mat.gsia.cmu.edu\/COLOR02\/"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9075-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-008-9075-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9075-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:29Z","timestamp":1559242469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-008-9075-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,28]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9075"],"URL":"https:\/\/doi.org\/10.1007\/s10732-008-9075-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,28]]}}}