{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T04:33:35Z","timestamp":1716611615808},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02023000","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T09:49:15Z","timestamp":1123667355000},"page":"343-358","source":"Crossref","is-referenced-by-count":37,"title":["On the use of some known methods forT-colorings of graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Daniel","family":"Costa","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02023000_CR1","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D. Abramson","year":"1991","unstructured":"D. Abramson, Constructing school timetables using simulated annealing: sequential and parallel algorithms, Manag. Sci. 37(1991)98\u2013113.","journal-title":"Manag. Sci."},{"key":"BF02023000_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz, New methods to color the vertices of a graph, Commun. ACM 22(1979)251\u2013256.","journal-title":"Commun. ACM"},{"key":"BF02023000_CR3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","volume":"17","author":"R.E. Burkard","year":"1984","unstructured":"R.E. Burkard and F. Rendl, A thermodynamically motivated simulation procedure for combinatorial optimization problems, Eur. J. Oper. Res. 17(1984)169\u2013174.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023000_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0377-2217(91)90254-S","volume":"51","author":"M. Cangalovic","year":"1991","unstructured":"M. Cangalovic and J. Schreuder, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, Eur. J. Oper. Res. 51(1991)248\u2013258.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023000_CR5","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, Some experiments with simulated annealing for coloring graphs, Eur. J. Oper. Res. 32(1987)260\u2013266.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023000_CR6","unstructured":"D. Costa, A tabu search algorithm for computing an operational timetable, Eur. J. Oper. Res. (1993), to appear."},{"key":"BF02023000_CR7","first-page":"191","volume":"35","author":"M. Cozzens","year":"1982","unstructured":"M. Cozzens and F.S. Roberts,T-colorings of graphs and the channel assignment problem, Congr. Numer. 35(1982)191\u2013208.","journal-title":"Congr. Numer."},{"key":"BF02023000_CR8","first-page":"115","volume":"41","author":"M. Cozzens","year":"1984","unstructured":"M. Cozzens and D. Wang, The general channel assignment problem, Congr. Numer. 41(1984)115\u2013129.","journal-title":"Congr. Numer."},{"key":"BF02023000_CR9","first-page":"1","volume":"32","author":"D. Werra de","year":"1988","unstructured":"D. de Werra and A. Hertz, Consecutive colorings of graphs, Zeits. Oper. Res. 32(1988)1\u20138.","journal-title":"Zeits. Oper. Res."},{"key":"BF02023000_CR10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra de","year":"1989","unstructured":"D. de Werra and A. Hertz, Tabu search techniques: a tutorial and an application to neural networks, OR Spektrum 11(1989)131\u2013141.","journal-title":"OR Spektrum"},{"key":"BF02023000_CR11","unstructured":"D. de Werra and Y. Gay, Chromatic scheduling and frequency assignment, Discr. Appl. Math. (1993), to appear."},{"key":"BF02023000_CR12","unstructured":"D. Dubois and D. de Werra, EPCOT: an efficient procedure for coloring optimally with tabu search, to appear in Comput. Math. Appl."},{"key":"BF02023000_CR13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search Part I, ORSA J. Comput. 1(1989)190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"BF02023000_CR14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search Part II, ORSA J. Comput. 2(1990)4\u201332.","journal-title":"ORSA J. Comput."},{"key":"BF02023000_CR15","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"W.K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68(1980)1497\u20131514.","journal-title":"Proc. IEEE"},{"key":"BF02023000_CR16","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, Using search techniques for graph coloring, Computing 39(1987)345\u2013351.","journal-title":"Computing"},{"key":"BF02023000_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01531073","volume":"1","author":"A. Hertz","year":"1990","unstructured":"A. Hertz and D. de Werra, The tabu search metaheuristic: how we used it, Ann. Math. Art. Int. 1(1990)111\u2013121.","journal-title":"Ann. Math. Art. Int."},{"key":"BF02023000_CR18","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/3341.3350","volume":"28","author":"M. Kubale","year":"1985","unstructured":"M. Kubale and B. Jackowski, A generalized implicit enumeration algorithm for graph coloring, Commun. ACM 28(1985)412\u2013418.","journal-title":"Commun. ACM"},{"key":"BF02023000_CR19","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1145\/358161.358171","volume":"26","author":"J. Peem\u00f6ller","year":"1983","unstructured":"J. Peem\u00f6ller, A correction to Br\u00e9laz's modification of Brown's coloring algorithm, Commun. ACM 26(1983)595\u2013597.","journal-title":"Commun. ACM"},{"key":"BF02023000_CR20","unstructured":"A. Raychaudhuri, Intersection assignments,T-coloring and powers of graphs, Ph.D. Thesis, Rutgers University (1985)."},{"key":"BF02023000_CR21","unstructured":"F.S. Roberts, From garbage to rainbows: generalizations of graph coloring and their applications, RUTCOR Research Report 36-88, Rutgers University (1988)."},{"key":"BF02023000_CR22","doi-asserted-by":"crossref","unstructured":"F. Semet and E. Taillard, Solving real-life vehicle routing problems efficiently using taboo search, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02023006"},{"key":"BF02023000_CR23","unstructured":"B.A. Tesman,T-colorings, listT-colorings and setT-colorings of graphs, Ph.D. Thesis, Rutgers University (1989)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023000.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023000\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T18:39:56Z","timestamp":1557772796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02023000"],"URL":"https:\/\/doi.org\/10.1007\/bf02023000","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}