{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:36:35Z","timestamp":1743028595183,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180076"},{"type":"electronic","value":"9783319180083"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_18","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"255-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["ILP and CP Formulations for the Lazy Bureaucrat Problem"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Furini","sequence":"first","affiliation":[]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]},{"given":"Markus","family":"Sinnl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0890-5401(03)00060-9","volume":"184","author":"EM Arkin","year":"2003","unstructured":"Arkin, E.M., Bender, M.A., Mitchell, J.S., Skiena, S.S.: The lazy bureaucrat scheduling problem. Information and Computation 184(1), 129\u2013146 (2003)","journal-title":"Information and Computation"},{"issue":"1\u20133","key":"18_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2006.06.001","volume":"362","author":"J Boyar","year":"2006","unstructured":"Boyar, J., Epstein, L., Favrholdt, L.M., Kohrt, J.S., Larsen, K.S., Pedersen, M.M., W\u00f8hlk, S.: The maximum resource bin packing problem. Theoretical Computer Science 362(1\u20133), 127\u2013139 (2006)","journal-title":"Theoretical Computer Science"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2013.12.008","volume":"46","author":"M Casazza","year":"2014","unstructured":"Casazza, M., Ceselli, A.: Mathematical programming algorithms for bin packing problems with item fragmentation. Computers & Operations Research 46, 1\u201311 (2014)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10878-007-9076-2","volume":"15","author":"L Gai","year":"2008","unstructured":"Gai, L., Zhang, G.: On lazy bureaucrat scheduling with common deadlines. Journal of Combinatorial Optimization 15(2), 191\u2013199 (2008)","journal-title":"Journal of Combinatorial Optimization"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-40164-0_18","volume-title":"Fundamentals of Computation Theory","author":"L Gourv\u00e9s","year":"2013","unstructured":"Gourv\u00e9s, L., Monnot, J., Pagourtzis, A.T.: The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design. In: Gasieniec, L., Wolter, F. (eds.) FCT 2013. Lecture Notes in Computer Science, vol. 8070, pp. 171\u2013182. Springer, Heidelberg (2013)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Management Science 45, 414\u2013424 (1999)","journal-title":"Management Science"},{"key":"18_CR7","unstructured":"Pisinger, D.: David Pisinger\u2019s optimization codes (2014). http:\/\/www.diku.dk\/pisinger\/codes.html"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/978-3-540-30201-8_47","volume-title":"Principles and Practice of Constraint Programming - CP 2004","author":"P Shaw","year":"2004","unstructured":"Shaw, P.: A constraint for bin packing. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 648\u2013662. Springer, Heidelberg (2004)"},{"issue":"1\u20134","key":"18_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1021801522545","volume":"118","author":"MA Trick","year":"2003","unstructured":"Trick, M.A.: A dynamic programming approach for consistency and propagation for knapsack constraints. Annals of Operations Research 118(1\u20134), 73\u201384 (2003)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,30]],"date-time":"2020-12-30T20:06:23Z","timestamp":1609358783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}