{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:47:35Z","timestamp":1743068855856,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030763060"},{"type":"electronic","value":"9783030763077"}],"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-76307-7_16","type":"book-chapter","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T20:03:07Z","timestamp":1620763387000},"page":"202-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Column Generation Based Algorithm for Solving the Log Transportation Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1370-7569","authenticated-orcid":false,"given":"Maximiliano R.","family":"Bord\u00f3n","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3337-6907","authenticated-orcid":false,"given":"Jorge M.","family":"Montagna","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0235-4262","authenticated-orcid":false,"given":"Gabriela","family":"Corsano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,12]]},"reference":[{"key":"16_CR1","unstructured":"National Census of Sawmills, Ministry of Agroindustry. https:\/\/www.magyp.gob.ar\/sitio\/areas\/ss_desarrollo_foresto_industrial\/censos_inventario\/_archivos\/censo\/000000_Provincia%20de%20Misiones%20(Marzo%202018).pdf. Accessed 06 Jul 2020"},{"key":"16_CR2","unstructured":"Forestry Report, Ministry of Agroindustry. https:\/\/www.agroindustria.gob.ar\/sitio\/areas\/ss_desarrollo_foresto_industrial\/estadisticas\/_archivos\/\/000000_Sector%20Forestal\/000000_Informes\/170000_2017%20-%20Sector%20Forestal.pdf. Accessed 06 Jul 2020"},{"key":"16_CR3","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-0-387-71921-4_4","volume-title":"Metaheuristics","author":"M Gronalt","year":"2007","unstructured":"Gronalt, M., Hirsch, P.: Log-truck scheduling with a tabu search strategy. In: Doerner, K.F., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R.F., Reimann, M. (eds.) Metaheuristics. Operations Research\/Computer Science Interfaces Series, pp. 65\u201388. Springer, Boston (2007)"},{"key":"16_CR4","unstructured":"Rix, G., Rousseau, L.-M., Pesant, G.: Solving a multi-period log-truck scheduling. In: 34th Council on Forest Engineering, Quebec, Canada, pp. 1\u201310. https:\/\/www.cirrelt.ca\/cofe2011\/proceedings\/29-rix.pdf. Accessed 20 Feb 2020"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ejor.2013.07.002","volume":"232","author":"N El Hachemi","year":"2014","unstructured":"El Hachemi, N., El Hallaoui, I., Gendreau, M., Rousseau, L.-M.: Flow-based integer linear programs to solve the weekly log-truck scheduling problem. Ann. Oper. Res. 232, 87\u201397 (2014)","journal-title":"Ann. Oper. Res."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.endm.2012.10.037","volume":"39","author":"U Derigs","year":"2012","unstructured":"Derigs, U., Pullman, M., Vogel, U., Oberscheider, M., Gronalt, M., Hirsch, P.: Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation. Electron. Not. Discrete Math. 39, 281\u2013288 (2012)","journal-title":"Electron. Not. Discrete Math."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.swevo.2016.01.003","volume":"28","author":"P Lin","year":"2016","unstructured":"Lin, P., Contreras, M., Dai, R., Zhang, J.: A multilevel ACO approach for solving forest transportation planning problems with environmental constraints. Swarm Evol. Comput. 28, 78\u201387 (2016)","journal-title":"Swarm Evol. Comput."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.forpol.2018.07.017","volume":"95","author":"MR Bord\u00f3n","year":"2018","unstructured":"Bord\u00f3n, M.R., Montagna, J.M., Corsano, G.: An exact mathematical formulation for the optimal log transportation. For. Policy Econ. 95, 115\u2013122 (2018)","journal-title":"For. Policy Econ."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1111\/j.1475-3995.2004.00469.x","volume":"11","author":"M Palmgren","year":"2004","unstructured":"Palmgren, M., Ronnqvist, M., Varbrand, P.: A near-exact method for solving the log-truck scheduling problem. Int. Trans. Oper. Res. 11, 447\u2013464 (2004)","journal-title":"Int. Trans. Oper. Res."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1057\/jors.2013.170","volume":"66","author":"G Rix","year":"2014","unstructured":"Rix, G., Rousseau, L.-M., Pesant, G.: A column generation algorithm for tactical timber transportation planning. J. Oper. Res. Soc. 66, 278\u2013287 (2014)","journal-title":"J. Oper. Res. Soc."},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/b135457","volume-title":"Column Generation","author":"G Desaulniers","year":"2005","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.: Column Generation. Springer, Boston (2005)"},{"issue":"6","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"key":"16_CR13","unstructured":"Rosenthal, R.E.: A GAMS tutorial. https:\/\/www.gams.com\/31\/docs\/index.html. Accessed 06 Jul 2020"}],"container-title":["Communications in Computer and Information Science","Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76307-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T20:21:41Z","timestamp":1620764501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76307-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030763060","9783030763077"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76307-7_16","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPR-Americas","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of Production Research \u2013 Americas","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bah\u00eda Blanca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpramericas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.matematica.uns.edu.ar\/ipcra\/default.php","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"275","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":"41","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":"11","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":"15% - 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":"3","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":"3.7","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)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}