{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:23:07Z","timestamp":1742952187167,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_32","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"492-510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Method Approaches for the Differential Harvest Problem"],"prefix":"10.1007","author":[{"given":"Gabriel","family":"Volte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Bourreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Naud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115(2), 351\u2013385 (2008). \nhttps:\/\/doi.org\/10.1007\/s10107-007-0178-5","journal-title":"Math. Program."},{"issue":"4","key":"32_CR2","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.biosystemseng.2009.09.003","volume":"104","author":"DD Bochtis","year":"2009","unstructured":"Bochtis, D.D., S\u00f8rensen, C.G.: The vehicle routing problem in field logistics part I. Biosyst. Eng. 104(4), 447\u2013457 (2009)","journal-title":"Biosyst. Eng."},{"issue":"2","key":"32_CR3","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.biosystemseng.2009.10.006","volume":"105","author":"DD Bochtis","year":"2010","unstructured":"Bochtis, D.D., S\u00f8rensen, C.G.: The vehicle routing problem in field logistics: part II. Biosyst. Eng. 105(2), 180\u2013188 (2010)","journal-title":"Biosyst. Eng."},{"key":"32_CR4","unstructured":"Bourreau, E., Gondran, M., Lacomme, P., Vinot, M.: De la Programmation Lin\u00e9aire \u00e0 la Programmation Par Contraintes (2019)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Briot, N., Bessiere, C., Tisseyre, B., Vismara, P.: Integration of operational constraints to optimize differential harvest in viticulture. In: Precision Agriculture 2015, pp. 111\u2013129. Wageningen Academic Publishers (2015)","DOI":"10.3920\/978-90-8686-814-8_60"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-319-23219-5_38","volume-title":"Principles and Practice of Constraint Programming","author":"N Briot","year":"2015","unstructured":"Briot, N., Bessiere, C., Vismara, P.: A constraint-based approach to the differential harvest problem. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 541\u2013556. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23219-5_38"},{"issue":"18","key":"32_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.3182\/20130828-2-SF-3019.00050","volume":"46","author":"M Burger","year":"2013","unstructured":"Burger, M., Huiskamp, M., Keviczky, T.: Complete field coverage as a multi-vehicle routing problem. IFAC Proc. Vol. 46(18), 97\u2013102 (2013)","journal-title":"IFAC Proc. Vol."},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo, C., Martinelli, R.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12, 129\u2013146 (2014)","journal-title":"Discrete Optim."},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G Dantzig","year":"1960","unstructured":"Dantzig, G., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8(1), 101\u2013111 (1960)","journal-title":"Oper. Res."},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.ejor.2009.11.026","volume":"204","author":"LMR dos Santos","year":"2010","unstructured":"dos Santos, L.M.R., Costa, A.M., Arenales, M.N., Santos, R.H.S.: Sustainable vegetable crop supply problem. Eur. J. Oper. Res. 204(3), 639\u2013647 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3), 216\u2013229 (2004)","journal-title":"Networks"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Column Generation","author":"S Irnich","year":"2005","unstructured":"Irnich, S., Desaulniers, G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, pp. 33\u201365. Springer, Boston (2005). \nhttps:\/\/doi.org\/10.1007\/0-387-25486-2_2"},{"issue":"1","key":"32_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s11119-005-0681-8","volume":"6","author":"A McBratney","year":"2005","unstructured":"McBratney, A., Whelan, B., Ancev, T., Bouma, J.: Future directions of precision agriculture. Precision Agric. 6(1), 7\u201323 (2005). \nhttps:\/\/doi.org\/10.1007\/s11119-005-0681-8","journal-title":"Precision Agric."},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.biosystemseng.2018.04.010","volume":"171","author":"M Plessen","year":"2018","unstructured":"Plessen, M.: Partial field coverage based on two path planning patterns. Biosyst. Eng. 171, 16\u201329 (2018)","journal-title":"Biosyst. Eng."},{"key":"32_CR15","unstructured":"Poullet, J., Parmentier, A.: Ground staff shift planning under delay uncertainty at air france. arXiv preprint \narXiv:1811.00171\n\n (2018)"},{"key":"32_CR16","first-page":"64","volume":"6241","author":"C Prud\u2019homme","year":"2014","unstructured":"Prud\u2019homme, C., Fages, J.-G., Lorca, X.: Choco documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, 64\u201370 (2014)","journal-title":"TASC, INRIA Rennes, LINA CNRS UMR"},{"issue":"1","key":"32_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s11119-008-9101-1","volume":"10","author":"M Reichardt","year":"2009","unstructured":"Reichardt, M., J\u00fcrgens, C.: Adoption and future perspective of precision farming in Germany: results of several surveys among different agricultural target groups. Precision Agric. 10(1), 73\u201394 (2009)","journal-title":"Precision Agric."},{"issue":"3","key":"32_CR18","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.ejor.2017.08.029","volume":"265","author":"M Robert","year":"2018","unstructured":"Robert, M., Bergez, J.-E., Thomas, A.: A stochastic dynamic programming approach to analyze adaptation to climate change-application to groundwater irrigation in India. Eur. J. Oper. Res. 265(3), 1033\u20131045 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"32_CR19","series-title":"Developments in Plant and Soil Sciences","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-94-017-2789-1_11","volume-title":"Progress in Plant Nutrition: Plenary Lectures of the XIV International Plant Nutrition Colloquium","author":"PC Robert","year":"2002","unstructured":"Robert, P.C.: Precision agriculture: a challenge for crop nutrition management. In: Horst, W.J., et al. (eds.) Progress in Plant Nutrition: Plenary Lectures of the XIV International Plant Nutrition Colloquium. Developments in Plant and Soil Sciences, vol. 98, pp. 143\u2013149. Springer, Dordrecht (2002). \nhttps:\/\/doi.org\/10.1007\/978-94-017-2789-1_11"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.biosystemseng.2018.01.006","volume":"169","author":"H Seyyedhasani","year":"2018","unstructured":"Seyyedhasani, H., Dvorak, J.: Reducing field work time using fleet routing optimization. Biosyst. Eng. 169, 1\u201310 (2018)","journal-title":"Biosyst. Eng."},{"key":"32_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)"},{"key":"32_CR22","unstructured":"Viaggi, D., Raggi, M., y Paloma, S.: An integer programming dynamic farm-household model to evaluate the impact of agricultural policy reforms on farm investment behaviour. Eur. J. Oper. Res. 207(2), 1130\u20131139 (2010)"},{"key":"32_CR23","volume-title":"Integer and Combinatorial Optimization","author":"LA Wolsey","year":"2014","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization. Wiley, Hoboken (2014)"},{"issue":"7","key":"32_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ifacol.2018.06.279","volume":"51","author":"RS Yagoubi","year":"2018","unstructured":"Yagoubi, R.S., Naud, O., Dejean, K.G., Crestani, D.: New approach for differential harvest problem: the model checking way. IFAC-PapersOnLine 51(7), 57\u201363 (2018)","journal-title":"IFAC-PapersOnLine"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:15:54Z","timestamp":1600409754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","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":"72","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":"25","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":"7","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":"3.08","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.08","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)"}}]}}