{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:18:37Z","timestamp":1752283117787,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030754174"},{"type":"electronic","value":"9783030754181"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-75418-1_7","type":"book-chapter","created":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T15:04:51Z","timestamp":1619795091000},"page":"122-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Mixed Approach for Pallet Building Problem with Practical Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2097-6572","authenticated-orcid":false,"given":"Manuel","family":"Iori","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7138-8653","authenticated-orcid":false,"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5935-846X","authenticated-orcid":false,"given":"Mayron C. O.","family":"Moreira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8118-6633","authenticated-orcid":false,"given":"Tiago","family":"Silveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,1]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.cie.2018.11.012","volume":"127","author":"MT Alonso","year":"2019","unstructured":"Alonso, M.T., Alvarez-Valdes, R., Iori, M., Parre\u00f1o, F.: Mathematical models for multi container loading problems with practical constraints. Comput. Ind. Eng. 127, 722\u2013733 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.omega.2016.02.002","volume":"66","author":"MT Alonso","year":"2017","unstructured":"Alonso, M.T., Alvarez-Valdes, R., Iori, M., Parre\u00f1o, F., Tamarit, J.M.: Mathematical models for multi container loading problems. OMEGA 66, 106\u2013117 (2017)","journal-title":"OMEGA"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/3264214","volume":"2016","author":"MT Alonso","year":"2016","unstructured":"Alonso, M.T., Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.M.: Algorithms for pallet building and truck loading in an interdepot transportation problem. Math. Probl. Eng. 2016, 1\u201311 (2016)","journal-title":"Math. Probl. Eng."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"3007","DOI":"10.1016\/j.cor.2004.04.010","volume":"32","author":"R Alvarez-Valdes","year":"2005","unstructured":"Alvarez-Valdes, 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":"7_CR5","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.M.: Reactive GRASP for the strip-packing problem. Comput. Oper. Res. 35, 1065\u20131083 (2008)","journal-title":"Comput. Oper. Res."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"EE Bischoff","year":"1995","unstructured":"Bischoff, E.E., Ratcliff, M.S.W.: Issues in the development of approaches to container loading. Omega 23, 377\u2013390 (1995)","journal-title":"Omega"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A Bortfeldt","year":"2001","unstructured":"Bortfeldt, A., Gehring, H.: A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131, 143\u2013161 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.12.006","volume":"229","author":"A Bortfeldt","year":"2013","unstructured":"Bortfeldt, A., W\u00e4scher, G.: Constraints in container loading - a state-of-the-art review. Eur. J. Oper. Res. 229, 1\u201320 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke, E.K., Kendall, G., Whitwell, G.: A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. 52, 655\u2013671 (2004)","journal-title":"Oper. Res."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: The bottomn-left bin-packing heuristic: an efficient implementation. IEEE Trans. Comput. C-32, 697\u2013707 (1983)","DOI":"10.1109\/TC.1983.1676307"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1287\/ijoc.1070.0250","volume":"20","author":"TG Crainic","year":"2008","unstructured":"Crainic, T.G., Perboli, G., Tadei, R.: Extreme point-based heuristics for three-dimensional bin packing. INFORMS J. Comput. 20, 368\u2013384 (2008)","journal-title":"INFORMS J. Comput."},{"key":"7_CR12","unstructured":"Crainic, T.G., Perboli, G., Tadei, R.: Recent advances in multi-dimensional packing problems. In: New Technologies, chap. 5. IntechOpen (2012)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/opre.2013.1248","volume":"62","author":"JF C\u00f4t\u00e9","year":"2014","unstructured":"C\u00f4t\u00e9, J.F., Dell\u2019Amico, M., Iori, M.: Combinatorial benders\u2019 cuts for the strip packing problem. Oper. Res. 62, 643\u2013661 (2014)","journal-title":"Oper. Res."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"da Silva, E.F., Le\u00e3o, A.A.S., Toledo, F.M.B., Wauters, T.: A matheuristic framework for the three-dimensional single large object placement problem with practical constraints. Comput. Oper. Res. 124, 105058 (2020)","DOI":"10.1016\/j.cor.2020.105058"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.ijpe.2013.04.032","volume":"145","author":"TA de Queiroz","year":"2013","unstructured":"de Queiroz, T.A., Miyazawa, F.K.: Two-dimensional strip packing problem with load balancing, load bearing and multi-drop constraints. Int. J. Prod. Econ. 145, 511\u2013530 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255, 1\u201320 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.cor.2016.09.009","volume":"78","author":"M Delorme","year":"2017","unstructured":"Delorme, M., Iori, M., Martello, S.: Logic based benders decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78, 290\u2013298 (2017)","journal-title":"Comput. Oper. Res."},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.ejor.2009.01.048","volume":"200","author":"J Egeblad","year":"2010","unstructured":"Egeblad, J., Garavelli, C., Lisi, S., Pisinger, D.: Heuristics for container loading of furniture.Eur. J. Oper. Res. 200, 881\u2013892 (2010)","journal-title":".Eur. J. Oper. Res."},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1287\/ijoo.2019.0013","volume":"1","author":"S Elhedhli","year":"2019","unstructured":"Elhedhli, S., Gzara, F., Yildiz, B.: Three-dimensional bin packing and mixed-case palletization. INFORMS J. Optim. 1(4), 323\u2013352 (2019)","journal-title":"INFORMS J. Optim."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/opre.13.1.94","volume":"13","author":"PC Gilmore","year":"1965","unstructured":"Gilmore, P.C., Gomory, R.E.: Multistage cutting stock problems of two or more dimensions. Oper. Res. 13, 94\u2013120 (1965)","journal-title":"Oper. Res."},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.ejor.2020.04.053","volume":"287","author":"F Gzara","year":"2020","unstructured":"Gzara, F., Elhedhli, S., Yildiz, B.C.: The pallet loading problem: three-dimensional bin packing with practical constraints. Eur. J. Oper. Res. 287(3), 1062\u20131074 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0377-2217(90)90364-H","volume":"44","author":"RW Haessler","year":"1990","unstructured":"Haessler, R.W., Talbot, F.B.: Load planning for shipments of low density products. Eur. J. Oper. Res. 44, 289\u2013299 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Hopper, E., Turton, B.: Application of genetic algorithms to packing problems - a review. In: Soft Computing in Engineering Design and Manufacturing, pp. 279\u2013288 (1998)","DOI":"10.1007\/978-1-4471-0427-8_30"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.cor.2009.05.008","volume":"37","author":"S Imahori","year":"2010","unstructured":"Imahori, S., Yagiura, M.: The best-fit heuristic for the rectangular strip packing problem: an efficient implementation and the worst-case approximation ratio. Comput. Oper. Res. 37, 325\u2013333 (2010)","journal-title":"Comput. Oper. Res."},{"key":"7_CR25","unstructured":"Iori, M., de Lima, V.L., Martello, S., Miyazawa, F.K., Monaci, M.: Two-dimensional cutting and packing: Problems and solution techniques. Eur. J. Oper. Res. (2020). (forthcoming)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Iori, M., Locatelli, M., Moreira, M.C.O., Silveira, T.: Solution of a practical pallet building problem with visibility and contiguity constraints. In: International Conference on Enterprise Information Systems, vol. 1, pp. 327\u2013338. SciTePress (2020)","DOI":"10.5220\/0009351703270338"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori, M., Martello, S.: Routing problems with loading constraints. TOP 18, 4\u201327 (2010)","journal-title":"TOP"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"311","DOI":"10.2298\/YJOR130315032I","volume":"23","author":"M Iori","year":"2013","unstructured":"Iori, M., Martello, S.: An annotated bibliography of combined routing and loading problems. Yugoslav J. Oper. Res. 23, 311\u2013326 (2013)","journal-title":"Yugoslav J. Oper. Res."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: Fixed set search applied to the traveling salesman problem, pp. 63\u201377. International Workshop on Hybrid Metaheuristics (2019)","DOI":"10.1007\/978-3-030-05983-5_5"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-030-34029-2_31","volume-title":"Analysis of Experimental Algorithms","author":"R Jovanovic","year":"2019","unstructured":"Jovanovic, R., Vo\u00df, S.: Fixed set search applied to the minimum weighted vertex cover problem. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 490\u2013504. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34029-2_31"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Jovanovic, R., Vo\u00df, S.: The fixed set search applied to the power dominating set problem. Expert Systems, p. e12559 (2020)","DOI":"10.1111\/exsy.12559"},{"key":"7_CR32","first-page":"29","volume":"10","author":"J J\u00f3zefowska","year":"2018","unstructured":"J\u00f3zefowska, J., Pawlak, G., Pesch, E., Morze, M., Kowalski, D.: Fast truck-packing of 3D boxes. Eng. Manage. Prod. Serv. 10, 29\u201340 (2018)","journal-title":"Eng. Manage. Prod. Serv."},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejor.2019.12.012","volume":"284","author":"DV Kurpel","year":"2020","unstructured":"Kurpel, D.V., Scarpin, C.T., P\u00e9cora Junior, J.E., Schenekemberg, C.M., Coelho, L.C.: The exact solutions of several types of container loading problems. Eur. J. Oper. Res. 284, 87\u2013107 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR34","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2011.06.002","volume":"215","author":"SCH Leung","year":"2011","unstructured":"Leung, S.C.H., Zhang, D., Sim, K.M.: A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur. J. Oper. Res. 215, 57\u201369 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Lodi, A., Martello, S., Monaci, M., Vigo, D.: Two-Dimensional Bin Packing Problems, pp. 107\u2013129. John Wiley & Sons, Ltd (2014)","DOI":"10.1002\/9781119005353.ch5"},{"key":"7_CR36","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.ejor.2006.11.012","volume":"184","author":"GHA Martins","year":"2008","unstructured":"Martins, G.H.A., Dell, R.F.: Solving the pallet loading problem. Eur. J. Oper. Res. 184, 429\u2013440 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Neli$$\\beta $$en, J.: How to use structural constraints to compute an upper bound for the pallet loading problem. Eur. J. Oper. Res. 84, 662\u2013680 (1995)","DOI":"10.1016\/0377-2217(95)00030-T"},{"key":"7_CR38","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.eswa.2019.07.020","volume":"137","author":"R Ranck J\u00fanior","year":"2019","unstructured":"Ranck J\u00fanior, R., Yanasse, H.H., Morabito, R., Junqueira, L.: A hybrid approach for a multi-compartment container loading problem. Expert Syst. Appl. 137, 471\u2013492 (2019)","journal-title":"Expert Syst. Appl."},{"key":"7_CR39","doi-asserted-by":"publisher","first-page":"2695","DOI":"10.1016\/j.cor.2005.10.008","volume":"34","author":"GM Ribeiro","year":"2007","unstructured":"Ribeiro, G.M., Lorena, L.A.N.: Lagrangean relaxation with clusters and column generation for the manufacturers pallet loading problem. Comput. Oper. Res. 34, 2695\u20132708 (2007)","journal-title":"Comput. Oper. Res."},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Scheithauer, G.: Introduction to Cutting and Packing Optimization. Springer International Publishing (2018)","DOI":"10.1007\/978-3-319-64403-5"},{"key":"7_CR41","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2012.08.014","volume":"224","author":"V Schmid","year":"2013","unstructured":"Schmid, V., Doerner, K.F., Laporte, G.: Rich routing problems arising in supply chain management. Eur. J. Oper. Res. 224, 435\u2013448 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR42","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1111\/itor.12099","volume":"23","author":"E Silva","year":"2016","unstructured":"Silva, E., Oliveira, J.F., W\u00e4scher, G.: The pallet loading problem: a review of solution methods and computational experiments. Int. Trans. Oper. Res. 23, 147\u2013172 (2016)","journal-title":"Int. Trans. Oper. Res."},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Terno, J.J., Scheithauer, G., Sommerwei$$\\beta $$, U., Riehme, J.: An efficient approach for the multi-pallet loading problem. J. Eur. J. Oper. Res. 123, 372\u2013381 (2000)","DOI":"10.1016\/S0377-2217(99)00263-5"},{"key":"7_CR44","unstructured":"Tsai, D.: Modeling and analysis of three-dimensional robotic palletizing systems for mixed carton sizes. Ph.D. thesis, Iowa State University (1987)"},{"key":"7_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231, 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"W\u00e4scher, G., Hau$$\\beta $$ner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109\u20131130 (2007)","DOI":"10.1016\/j.ejor.2005.12.047"},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Wu, K.C., Ting, C.J.: A two-phase algorithm for the manufacturer\u2019s pallet loading problem. In: IEEE International Conference on Industrial Engineering and Engineering Management, pp. 1574\u20131578 (2007)","DOI":"10.1109\/IEEM.2007.4419457"}],"container-title":["Lecture Notes in Business Information Processing","Enterprise Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75418-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T15:20:21Z","timestamp":1623770421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75418-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030754174","9783030754181"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75418-1_7","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICEIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Enterprise Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iceis2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iceis.org\/?y=2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"255","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":"90","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":"37","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":"35% - 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":"4","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}