{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T18:14:44Z","timestamp":1758478484092},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T00:00:00Z","timestamp":1107907200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s10107-004-0567-y","type":"journal-article","created":{"date-parts":[[2005,2,8]],"date-time":"2005-02-08T10:13:14Z","timestamp":1107857594000},"page":"21-37","source":"Crossref","is-referenced-by-count":7,"title":["An asymptotically exact algorithm for the high-multiplicity bin packing problem"],"prefix":"10.1007","volume":"104","author":[{"given":"Carlo","family":"Filippi","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Agnetis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,2,9]]},"reference":[{"key":"567_CR1","unstructured":"Althaus, E., Eisenbrand, F., Funke, S., Mehlhorn, K.: Point containment in the integer hull of a polyhedron. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA , 2004"},{"key":"567_CR2","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0602044","volume":"2","author":"Baum","year":"4","unstructured":"Baum, S., Trotter, L.E. Jr.: Integer rounding for polymatroid and branching problems. SIAM J. Algebraic Discrete Methods 2 (4), 416\u2013425 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"567_CR3","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F.: Fast integer programming in fixed dimension. Technical Report MPI\u2013I\u2013 2003\u2013NWG2-002, Max-Planck-Institut f\u00fcr Informatik Saarbr\u00fccken, Germany, February 2003","DOI":"10.1007\/978-3-540-39658-1_20"},{"key":"567_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica 7, 49\u201365 (1987)","journal-title":"Combinatorica"},{"key":"567_CR5","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Springer-Verlag, Berlin, Germany, 1988","DOI":"10.1007\/978-3-642-97881-4"},{"key":"567_CR6","doi-asserted-by":"crossref","first-page":"2285","DOI":"10.1137\/S009753979528977X","volume":"28","author":"Harvey","year":"6","unstructured":"Harvey, W.: Computing two-dimensional integer hulls. SIAM J. Comput. 28 (6), 2285\u20132299 (1999)","journal-title":"SIAM J. Comput."},{"key":"567_CR7","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.39.4.648","volume":"39","author":"Hochbaum","year":"1991","unstructured":"Hochbaum, D.S., Shamir, R.: Strongly polynomial algorithms for the high multiplicity scheduling problem. Oper. Res. 39, 648\u2013653 (1991)","journal-title":"Oper. Res."},{"key":"567_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01719835","volume":"9","author":"Isermann","year":"1987","unstructured":"Isermann, H.: Ein Planungssystem zur Optimierung der Palettenbeladung mit kongruenten rechteckigen Versandgebinden. OR Spektrum 9, 235\u2013249 (1987)","journal-title":"OR Spektrum"},{"key":"567_CR9","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1080\/00029890.1981.11995228","volume":"88","author":"Kertzner","year":"1981","unstructured":"Kertzner, S.: The linear diophantine equation. Am. Math. Mon. 88, 200\u2013203 (1981)","journal-title":"Am. Math. Mon."},{"key":"567_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1287\/opre.30.1.163","volume":"30","author":"Leung","year":"1982","unstructured":"Leung, J.Y.-T.: On scheduling independent tasks with restricted execution times. Oper. Res. 30, 163\u2013171 (1982)","journal-title":"Oper. Res."},{"key":"567_CR11","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF01582013","volume":"33","author":"Marcotte","year":"1985","unstructured":"Marcotte, O.: The cutting stock problem and integer rounding. Math. Program. 33, 82\u201392 (1985)","journal-title":"Math. Program."},{"key":"567_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/moor.26.1.31.10590","volume":"26","author":"McCormick","year":"2001","unstructured":"McCormick, S.T., Smallwood, S.R., Spieksma, F.C.R.: A polynomial algorithm for multiprocessor scheduling with two job lengths. Math. Oper. Res. 26, 31\u201349 (2001)","journal-title":"Math. Oper. Res."},{"key":"567_CR13","unstructured":"Neli\u00dfen, J.: New Approaches to the Pallet Loading Problem. Working Paper, RWTH Aachen, 1993. Available via anonymous ftp from ftp:\/\/ftp.informatik.rwth-aachen.de (137.226.225.3) as \/pub\/reports\/others\/pallet.ps.gz"},{"key":"567_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0166-218X(01)00361-4","volume":"121","author":"Rietz","year":"2002","unstructured":"Rietz, J., Scheithauer, G., Terno, J.: Families of non-IRUP instances of the one-dimensional cutting stock problem. Discrete Appl. Math. 121, 229\u2013245 (2002)","journal-title":"Discrete Appl. Math."},{"key":"567_CR15","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience, Chichester, 1986"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0567-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0567-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0567-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T17:31:49Z","timestamp":1586107909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0567-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["567"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0567-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2,9]]}}}