{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:33:59Z","timestamp":1742938439645,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030678982"},{"type":"electronic","value":"9783030678999"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67899-9_29","type":"book-chapter","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:05:55Z","timestamp":1611792355000},"page":"359-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithmic Analysis of Priority-Based Bin Packing"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Wojciechowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alvaro","family":"Velasquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bugra","family":"Caskurlu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,28]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"3007","DOI":"10.1016\/j.cor.2004.04.010","volume":"32","author":"R Alvarez-Vald\u00e9s","year":"2005","unstructured":"Alvarez-Vald\u00e9s, R., Parre\u00f1o, F., Tamarit, J.M.: A branch-and-cut algorithm for the pallet loading problem. Comput. Oper. Res. 32, 3007\u20133029 (2005)","journal-title":"Comput. Oper. Res."},{"key":"29_CR2","unstructured":"Anari, N., Vazirani, V.V.: Matching is as easy as the decision problem, in the NC model. CoRR, abs\/1901.10387 (2019)"},{"issue":"3","key":"29_CR3","first-page":"425","volume":"24","author":"MM Baldi","year":"2017","unstructured":"Baldi, M.M., Bruglieri, M.: On the generalized bin packing problem. ITOR 24(3), 425\u2013438 (2017)","journal-title":"ITOR"},{"key":"29_CR4","unstructured":"Ballew, B.: The distributor\u2019s three-dimensional pallet-packing problem: a mathematical formulation and heuristic solution approach, p. 111, March 2000"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-11269-0_6","volume-title":"Parameterized and Exact Computation","author":"C Calabro","year":"2009","unstructured":"Calabro, C., Impagliazzo, R., Paturi, R.: The complexity of satisfiability of small depth circuits. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 75\u201385. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11269-0_6"},{"key":"29_CR6","unstructured":"Chandran, B.G., Hochbaum, D.S.: Practical and theoretical improvements for bipartite matching using the pseudoflow algorithm. CoRR, abs\/1105.1569 (2011)"},{"issue":"8","key":"29_CR7","first-page":"272","volume":"8","author":"J Csirik","year":"1974","unstructured":"Csirik, J., Johnson, D.S., Kenyon, C., Orlin, J.B., Shor, P.W., Weber, R.R.: Fast algorithms for bin packing. J. Comput. Syst. Sci. 8(8), 272\u2013314 (1974)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/S0377-2217(98)00139-8","volume":"114","author":"A Paul Davies","year":"1999","unstructured":"Paul Davies, A., Bischoff, E.E.: Weight distribution considerations in container loading. Eur. J. Oper. Res. 114(3), 509\u2013527 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.tcs.2006.05.023","volume":"359","author":"B Escoffier","year":"2006","unstructured":"Escoffier, B., Paschos, V.T.: Completeness in approximation classes beyond apx. Theor. Comput. Sci. 359(1), 369\u2013377 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithm","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithm, 1st edn. Springer, Heidelberg (2010)","edition":"1"},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"29_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman Company, San Francisco (1979)"},{"issue":"3","key":"29_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/05695558208974601","volume":"14","author":"TJ Hodgson","year":"1982","unstructured":"Hodgson, T.J.: A combined approach to the pallet loading problem. IIE Trans. 14(3), 175\u2013182 (1982)","journal-title":"IIE Trans."},{"key":"29_CR14","volume-title":"Introduction to Parallel Algorithms","author":"J JaJa","year":"1992","unstructured":"JaJa, J.: Introduction to Parallel Algorithms, 1st edn. Addison Wesley, Boston (1992)","edition":"1"},{"issue":"1","key":"29_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.jcss.2012.04.004","volume":"79","author":"K Jansen","year":"2013","unstructured":"Jansen, K., Kratsch, S., Marx, D., Schlotter, I.: Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79(1), 39\u201349 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic approximation algorithm for 3D-strip packing. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, 22\u201326 January 2006, pp. 143\u2013152. ACM Press (2006)","DOI":"10.1145\/1109557.1109575"},{"key":"29_CR17","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bull. EATCS, 41\u201371 (2011)"},{"key":"29_CR18","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley, Hoboken (1990)"},{"key":"29_CR19","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, New York (1999)"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ejor.2017.11.010","volume":"267","author":"C Paquay","year":"2018","unstructured":"Paquay, C., Limbourg, S., Schyns, M.: A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints. Eur. J. Oper. Res. 267(1), 52\u201364 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2298\/YJOR0901003P","volume":"19","author":"V Paschos","year":"2009","unstructured":"Paschos, V.: An overview on polynomial approximation of NP-hard problems. Yugoslav J. Oper. Res. 19, 3\u201340 (2009)","journal-title":"Yugoslav J. Oper. Res."},{"issue":"5","key":"29_CR22","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.sbspro.2014.01.101","volume":"111","author":"G Perboli","year":"2014","unstructured":"Perboli, G., Gobbato, L., Perfetti, F.: Packing problems in transportation and supply chain: new problems and trends. Proc. - Soc. Behav. Sci. 111(5), 672\u2013681 (2014)","journal-title":"Proc. - Soc. Behav. Sci."},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0925-5273(92)90034-5","volume":"28","author":"B Ram","year":"1992","unstructured":"Ram, B.: The pallet loading problem: a survey. Int. J. Prod. Econ. 28, 217\u2013225 (1992)","journal-title":"Int. J. Prod. Econ."},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2015.07.050","volume":"600","author":"MP Renault","year":"2015","unstructured":"Renault, M.P., Ros\u00e9n, A., van Stee, R.: Online algorithms with advice for bin packing and scheduling problems. Theor. Comput. Sci. 600, 155\u2013170 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L Stockmeyer","year":"1984","unstructured":"Stockmeyer, L., Vishkin, U.: Simulation of parallel random access machines by circuits. SIAM J. Comput. 13, 409\u2013422 (1984)","journal-title":"SIAM J. Comput."},{"key":"29_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-58628-7_7","volume-title":"Algorithmic Aspects of Cloud Computing","author":"K Subramani","year":"2020","unstructured":"Subramani, K., Caskurlu, B., Acikalin, U.U.: Security-aware database migration planning. In: Brandic, I., Genez, T.A.L., Pietri, I., Sakellariou, R. (eds.) ALGOCLOUD 2019. LNCS, vol. 12041, pp. 103\u2013121. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58628-7_7"},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-19759-9_1","volume-title":"Algorithmic Aspects of Cloud Computing","author":"K Subramani","year":"2019","unstructured":"Subramani, K., Caskurlu, B., Velasquez, A.: Minimization of testing costs in capacity-constrained database migration. In: Disser, Y., Verykios, V.S. (eds.) ALGOCLOUD 2018. LNCS, vol. 11409, pp. 1\u201312. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19759-9_1"},{"issue":"2","key":"29_CR28","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/S0377-2217(99)00263-5","volume":"123","author":"J Terno","year":"2000","unstructured":"Terno, J., Scheithauer, G., Sommerwei\u00df, U., Riehme, J.: An efficient approach for the multi-pallet loading problem. Eur. J. Oper. Res. 123(2), 372\u2013381 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR29","doi-asserted-by":"publisher","first-page":"69","DOI":"10.21501\/21454086.1790","volume":"15","author":"S Vargas-Osorio","year":"2016","unstructured":"Vargas-Osorio, S., Zuniga, C.: A literature review on the pallet loading problem. Lampsakos 15, 69\u201380 (2016)","journal-title":"Lampsakos"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Zhou, K.: The pallet loading method of single category cargo based on railway containerized transport. In: Proceedings of the 2018 10th International Conference on Computer and Automation Engineering, ICCAE 2018, Brisbane, Australia, 24\u201326 February 2018, pp. 243\u2013249. ACM (2018)","DOI":"10.1145\/3192975.3193010"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67899-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T00:13:09Z","timestamp":1611792789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67899-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030678982","9783030678999"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67899-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rupnagar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitrpr.ac.in\/caldam2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,21","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}