{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:28:04Z","timestamp":1761888484798,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":1785,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s13676-014-0061-5","type":"journal-article","created":{"date-parts":[[2014,9,24]],"date-time":"2014-09-24T02:25:31Z","timestamp":1411525531000},"page":"421-443","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["A branch-and-price method for a ship routing and scheduling problem with cargo coupling and synchronization constraints"],"prefix":"10.1016","volume":"4","author":[{"given":"Magnus","family":"St\u00e5lhane","sequence":"first","affiliation":[]},{"given":"Henrik","family":"Andersson","sequence":"additional","affiliation":[]},{"given":"Marielle","family":"Christiansen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1007\/s13676-014-0061-5_bib1","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1016\/j.cie.2011.07.001","article-title":"Ship routing and scheduling with cargo coupling and synchronization constraints","volume":"61","author":"Andersson","year":"2011","journal-title":"Comput Ind Eng"},{"issue":"3","key":"10.1007\/s13676-014-0061-5_bib2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Oper Res"},{"key":"10.1007\/s13676-014-0061-5_bib3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","article-title":"Static pickup and delivery problems: a classification scheme and survey","volume":"15","author":"Berbeglia","year":"2007","journal-title":"TOP"},{"key":"10.1007\/s13676-014-0061-5_bib4","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.cor.2005.05.017","article-title":"A multi-start local search heuristic for ship scheduling\u2014a computational study","volume":"34","author":"Br\u00f8nmo","year":"2007","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13676-014-0061-5_bib5","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.ejor.2012.12.002","article-title":"Ship routing and scheduling in the new millennium","volume":"228","author":"Christiansen","year":"2013","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-014-0061-5_bib6","series-title":"Network routing, handbooks in operations research and management science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","article-title":"Time constrained routing and scheduling","author":"Desrosiers","year":"1995"},{"issue":"4","key":"10.1007\/s13676-014-0061-5_bib7","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","article-title":"The manpower allocation problem with time windows and job-teaming constraints: a branch-and-price approach","volume":"36","author":"Dohn","year":"2009","journal-title":"Comput Oper Res"},{"issue":"4","key":"10.1007\/s13676-014-0061-5_bib8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.20472","article-title":"The vehicle routing problem with time windows and temporal dependencies","volume":"58","author":"Dohn","year":"2011","journal-title":"Networks"},{"issue":"3","key":"10.1007\/s13676-014-0061-5_bib9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","article-title":"Synchronization in vehicle routing\u2014a survey of vrps with multiple synchronization constraints","volume":"46","author":"Drexl","year":"2012","journal-title":"Transp Sci"},{"issue":"1","key":"10.1007\/s13676-014-0061-5_bib10","first-page":"94","article-title":"Routing and scheduling in project shipping","volume":"36","author":"Fagerholt","year":"2011","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13676-014-0061-5_bib11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(98)00343-9","article-title":"Fleet assignment and routing with schedule synchronization constraints","volume":"199","author":"Ioachim","year":"1999","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-014-0061-5_bib12","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1057\/jors.2008.192","article-title":"A tabu search heuristic for ship routing and scheduling","volume":"61","author":"Korsvik","year":"2010","journal-title":"J Oper Res Soc"},{"year":"1972","author":"Lawrence","series-title":"International sea transport: the years ahead","key":"10.1007\/s13676-014-0061-5_bib13"},{"issue":"6","key":"10.1007\/s13676-014-0061-5_bib14","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","article-title":"Selected topics in column generation","volume":"53","author":"L\u00fcbbecke","year":"2005","journal-title":"Oper Res"},{"key":"10.1007\/s13676-014-0061-5_bib15","first-page":"273","article-title":"A variable neighborhood search heuristic for tramp ship scheduling","volume":"6971","author":"Malliappi","year":"2011","journal-title":"Comput Logist Lect Notes Comput Sci"},{"issue":"3","key":"10.1007\/s13676-014-0061-5_bib16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","article-title":"Branch-and-cut-and-price for the pickup and delivery problem with time windows","volume":"43","author":"R\u00f8pke","year":"2009","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-014-0061-5_bib17","doi-asserted-by":"crossref","first-page":"3361","DOI":"10.1016\/j.cor.2012.04.021","article-title":"A branch-price-and-cut method for a ship routing and scheduling problem with split loads","volume":"39","author":"St\u00e5lhane","year":"2012","journal-title":"Comput Oper Res"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-014-0061-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-014-0061-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620301102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620301102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-014-0061-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:43:52Z","timestamp":1761882232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620301102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["S2192437620301102"],"URL":"https:\/\/doi.org\/10.1007\/s13676-014-0061-5","relation":{},"ISSN":["2192-4376"],"issn-type":[{"type":"print","value":"2192-4376"}],"subject":[],"published":{"date-parts":[[2015,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A branch-and-price method for a ship routing and scheduling problem with cargo coupling and synchronization constraints","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-014-0061-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}