{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:24:49Z","timestamp":1725665089933},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642280757"},{"type":"electronic","value":"9783642280764"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28076-4_9","type":"book-chapter","created":{"date-parts":[[2012,2,27]],"date-time":"2012-02-27T08:53:14Z","timestamp":1330332794000},"page":"64-75","source":"Crossref","is-referenced-by-count":4,"title":["Approximating the Multi-level Bottleneck Assignment Problem"],"prefix":"10.1007","author":[{"given":"Trivikram","family":"Dokka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasia","family":"Kouvela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aringhieri, R., Cordone, R.: The multicommodity multilevel bottleneck assignment problem (2004)","DOI":"10.1016\/j.endm.2004.03.010"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/0377-2217(92)90213-S","volume":"58","author":"L. Bianco","year":"1992","unstructured":"Bianco, L., Bielli, M., Mingozzi, A., Ricciardelli, S., Spadoni, M.: A heuristic procedure for the crew rostering problem. European Journal of Operational Research\u00a058, 272\u2013283 (1992)","journal-title":"European Journal of Operational Research"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(94)90009-4","volume":"55","author":"H. Bodlaender","year":"1994","unstructured":"Bodlaender, H., Jansen, K., Woeginger, G.: Scheduling with incompatible jobs. Discrete Applied Mathematics\u00a055, 219\u2013232 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. SIAM (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1287\/opre.1040.0110","volume":"52","author":"P. Cappanera","year":"2004","unstructured":"Cappanera, P., Gallo, G.: A multicommodity flow approach to the crew rostering problem. Operations Research\u00a052, 583\u2013596 (2004)","journal-title":"Operations Research"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0377-2217(84)90071-7","volume":"16","author":"P. Carraresi","year":"1984","unstructured":"Carraresi, P., Gallo, G.: A multi-level bottleneck assignment approach to the bus drivers rostering problem. European Journal of Operations Research\u00a016, 163\u2013173 (1984)","journal-title":"European Journal of Operations Research"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11590-009-0152-7","volume":"4","author":"D. Goossens","year":"2010","unstructured":"Goossens, D., Polyakovskiy, S., Spieksma, F., Woeginger, G.: The approximability of three-dimensional assignment problems with bottleneck objective. Optimization Letters\u00a04, 4\u201317 (2010)","journal-title":"Optimization Letters"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/moor.9.3.376","volume":"9","author":"W.-L. Hsu","year":"1984","unstructured":"Hsu, W.-L.: Approximation algorithms for the assembly line balancing crew scheduling problem. Mathematics of Operations Research\u00a09, 376\u2013383 (1984)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K. Jansen","year":"1998","unstructured":"Jansen, K.: An approximation scheme for bin packing with conflicts. Journal of Combinatorial Optimization\u00a03, 363\u2013377 (1998)","journal-title":"Journal of Combinatorial Optimization"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1287\/moor.9.3.384","volume":"9","author":"E. Coffman Jr.","year":"1984","unstructured":"Coffman Jr., E., Yannakakis, M.: Permuting elements within columns of a matrix in order to minimize maximum row sum. Mathematics of Operations Research\u00a09, 384\u2013390 (1984)","journal-title":"Mathematics of Operations Research"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-61576-8_80","volume-title":"Combinatorics and Computer Science","author":"B. Klinz","year":"1996","unstructured":"Klinz, B., Woeginger, G.: A New Efficiently Solvable Case of the Three-Dimensional Axial Bottleneck Assignment Problem. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol.\u00a01120, pp. 150\u2013162. Springer, Heidelberg (1996)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(96)00128-X","volume":"76","author":"M. Queyranne","year":"1997","unstructured":"Queyranne, M., Spieksma, F.: Approximation algorithms for multi-index transportation problems with decomposable costs. Discrete Applied Mathematics\u00a076, 239\u2013254 (1997)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28076-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:44:21Z","timestamp":1556419461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28076-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642280757","9783642280764"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28076-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}