{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:41:31Z","timestamp":1774435291855,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T00:00:00Z","timestamp":1078099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,3]]},"DOI":"10.1016\/s0305-0548(02)00195-8","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T20:48:55Z","timestamp":1044391735000},"page":"347-358","source":"Crossref","is-referenced-by-count":113,"title":["Heuristics and lower bounds for the bin packing problem with conflicts"],"prefix":"10.1016","volume":"31","author":[{"given":"Michel","family":"Gendreau","sequence":"first","affiliation":[]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Semet","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00195-8_BIB1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0305-0548(84)90036-4","article-title":"Examination timetabling by computer","volume":"11","author":"Laporte","year":"1984","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1009871302966","article-title":"An approximation scheme for bin packing with conflicts","volume":"3","author":"Jansen","year":"1999","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB3","series-title":"Combinatorial optimization","first-page":"339","article-title":"Loading problems","author":"Christofides","year":"1979"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB4","unstructured":"Martello S, Toth P. Knapsack problems. Chichester: Wiley, 1990a."},{"key":"10.1016\/S0305-0548(02)00195-8_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(93)90165-P","article-title":"Bounded vertex colorings of graphs","volume":"111","author":"Hansen","year":"1993","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","article-title":"A typology of cutting and packing problems","volume":"44","author":"Dycknoff","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/inco.1996.2616","article-title":"Approximation algorithms for time constrained scheduling","volume":"132","author":"Jansen","year":"1997","journal-title":"Information and Computation"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(96)00031-X","article-title":"Mutual exclusion scheduling","volume":"162","author":"Baker","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB9","first-page":"291","article-title":"On the complexity of scheduling incompatible jobs with unit-times","volume":"711","author":"Bodlaender","year":"1993","journal-title":"Mathematical Foundations of Computer Science, MFCS 93, LNCS"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","article-title":"Examination timetabling","volume":"47","author":"Carter","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB11","series-title":"Algorithm design for computer system design","first-page":"49","article-title":"Approximation algorithms for bin-packing\u2014an updated survey","author":"Coffman","year":"1984"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Br\u00e9laz","year":"1979","journal-title":"Communications of the Association for Computing Machinery"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB13","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"Journal of Computer and System Science"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB14","series-title":"Discrete optimization algorithms with PASCAL programs","author":"Syslo","year":"1983"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB15","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF00226291","article-title":"A hybrid grouping genetic algorithm","volume":"2","author":"Falkenauer","year":"1996","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB16","series-title":"Cliques, coloring and satisfiability","first-page":"221","article-title":"Tabu search algorithms for the maximum clique problem","volume":"Vol. 26","author":"Soriano","year":"1996"},{"key":"10.1016\/S0305-0548(02)00195-8_BIB17","doi-asserted-by":"crossref","unstructured":"Martello S, Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 1990b;28:59\u201370.","DOI":"10.1016\/0166-218X(90)90094-S"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001958?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802001958?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:56:52Z","timestamp":1553914612000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802001958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,3]]}},"alternative-id":["S0305054802001958"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00195-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}