{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T15:48:48Z","timestamp":1759160928374,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030107307"},{"type":"electronic","value":"9783030107314"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-10731-4_3","type":"book-chapter","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:33:28Z","timestamp":1548725608000},"page":"29-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Benders Decomposition Algorithm for\u00a0the Berth Allocation Problem"],"prefix":"10.1007","author":[{"given":"Fl\u00e1via","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Fernando","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"Maria Ant\u00f3nia","family":"Carravilla","sequence":"additional","affiliation":[]},{"given":"Eduardo Ferian","family":"Curcio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,30]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","volume":"47","author":"K Buhrkal","year":"2011","unstructured":"Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., Lusby, R.: Models for the discrete berth allocation problem: a computacional comparison. Transportation Research Part E: Logistics and Transportation Review 47(4), 461\u2013473 (2011)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1007\/s11590-015-0918-z","volume":"10","author":"M Caramia","year":"2016","unstructured":"Caramia, M., Mari, R.: A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints. Optimization Letters 10(5), 997\u20131019 (2016)","journal-title":"Optimization Letters"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato, G., Fischetti, M.: Combinatorial benders\u2019 cuts for mixed integer linear programming. Operations Research 54(4), 756\u2013766 (2006)","journal-title":"Operations Research"},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"JF Cordeau","year":"2005","unstructured":"Cordeau, J.F., Laporte, G., Legato, P., Moccia, L.: Models and tabu search heuristics for the berth allocation problem. Transportation Science 39(4), 526\u2013538 (2005)","journal-title":"Transportation Science"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. Journal of Optimization Theory and Applications 10(4), 237\u2013260 (1972)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"3_CR6","first-page":"127","volume":"49","author":"N Grubi\u0161i\u0107","year":"2015","unstructured":"Grubi\u0161i\u0107, N., Vilke, S., Bari\u0107, M.: A Contribution to Berth Allocation Problem Solution with Draft Restrictions. Pomorski zbornik 49(1), 127\u2013142 (2015)","journal-title":"Pomorski zbornik"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00291-003-0140-8","volume":"26","author":"Y Guan","year":"2004","unstructured":"Guan, Y., Cheung, R.K.: The berth allocation problem: models and solution methods. Or Spectrum 26(1), 75\u201392 (2004)","journal-title":"Or Spectrum"},{"issue":"8","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1007\/s11590-014-0798-7","volume":"9","author":"Z Huang","year":"2015","unstructured":"Huang, Z., Zheng, Q.P.: Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs. Optimization Letters 9(8), 1553\u20131568 (2015)","journal-title":"Optimization Letters"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"TL Magnanti","year":"1981","unstructured":"Magnanti, T.L., Wong, R.T.: Accelerating benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research 29(3), 464\u2013484 (1981)","journal-title":"Operations Research"},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1016\/j.cor.2003.11.013","volume":"32","author":"A Mercier","year":"2005","unstructured":"Mercier, A., Cordeau, J.F., Soumis, F.: A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Computers & Operations Research 32(6), 1451\u20131476 (2005)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1287\/trsc.1060.0171","volume":"41","author":"MF Monaco","year":"2007","unstructured":"Monaco, M.F., Sammarra, M.: The berth allocation problem: A strong formulation solved by a lagrangean approach. Transportation Science 41(2), 265\u2013280 (2007)","journal-title":"Transportation Science"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1137\/S00361445023685","volume":"45","author":"G Pataki","year":"2003","unstructured":"Pataki, G.: Teaching integer programming formulations using the traveling salesman problem. SIAM REV 45, 116\u2013123 (2003)","journal-title":"SIAM REV"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.ifacol.2015.06.193","volume":"48","author":"S Pratap","year":"2015","unstructured":"Pratap, S., Nayak, A., Cheikhrouhou, N., Tiwari, M.K.: Decision support system for discrete robust berth allocation. IFAC-PapersOnLine 48(3), 875\u2013880 (2015)","journal-title":"IFAC-PapersOnLine"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ejor.2005.10.063","volume":"177","author":"RV Rasmussen","year":"2007","unstructured":"Rasmussen, R.V., Trick, M.A.: A Benders approach for the constrained minimum break problem. European Journal of Operational Research 177(1), 198\u2013213 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: The Benders decomposition algorithm: A literature review. European Journal of Operational Research 259(3), 801\u2013817 (2017)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10479-011-1050-9","volume":"210","author":"L Tang","year":"2013","unstructured":"Tang, L., Jiang, W., Saharidis, G.K.: An improved benders decomposition algorithm for the logistics facility location problem with capacity expansions. Annals of Operations Research 210(1), 165\u2013190 (2013)","journal-title":"Annals of Operations Research"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Task\u0131n, Z.C.: Benders decomposition. Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Malden (MA) (2010)","DOI":"10.1002\/9780470400531.eorms0104"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s11590-014-0787-x","volume":"9","author":"E Theodorou","year":"2015","unstructured":"Theodorou, E., Diabat, A.: A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results. Optimization Letters 9(4), 799\u2013817 (2015)","journal-title":"Optimization Letters"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.ejor.2015.11.025","volume":"251","author":"AK Vatsa","year":"2016","unstructured":"Vatsa, A.K., Jayaswal, S.: A new formulation and benders decomposition for the multi-period maximal covering facility location problem with server uncertainty. European Journal of Operational Research 251(2), 404\u2013418 (2016)","journal-title":"European Journal of Operational Research"}],"container-title":["Springer Proceedings in Mathematics & Statistics","Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10731-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:21:46Z","timestamp":1558419706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-10731-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030107307","9783030107314"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10731-4_3","relation":{},"ISSN":["2194-1009","2194-1017"],"issn-type":[{"type":"print","value":"2194-1009"},{"type":"electronic","value":"2194-1017"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Congress of APDIO, the Portuguese Operational Research Society","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aveiro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apdio2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/apdio.pt\/web\/io2018\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}