{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T02:57:28Z","timestamp":1775703448180,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T00:00:00Z","timestamp":1601078400000},"content-version":"vor","delay-in-days":483,"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":[[2019,6]]},"DOI":"10.1007\/s13676-018-0119-x","type":"journal-article","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T10:09:31Z","timestamp":1520330971000},"page":"195-216","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":31,"title":["The price of discretizing time: a study in service network design"],"prefix":"10.1016","volume":"8","author":[{"given":"Natashia","family":"Boland","sequence":"first","affiliation":[]},{"given":"Mike","family":"Hewitt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0633-4004","authenticated-orcid":false,"given":"Luke","family":"Marshall","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Savelsbergh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13676-018-0119-x_bib1","series-title":"Network flows\u2014theory, algorithms and applications","author":"Ahuja","year":"1993"},{"issue":"2","key":"10.1007\/s13676-018-0119-x_bib2","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ejor.2007.10.057","article-title":"Service network design with management and coordination of multiple fleets","volume":"193","author":"Andersen","year":"2009","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/trsc.1100.0333","article-title":"Branch and price for service network design with asset management constraints","volume":"45","author":"Andersen","year":"2010","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-018-0119-x_bib4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.trb.2013.11.001","article-title":"Stochastic service network design with rerouting","volume":"60","author":"Bai","year":"2014","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.orl.2004.11.011","article-title":"Accelerated label setting algorithms for the elementary resource constrained shortest path problem","volume":"34","author":"Boland","year":"2006","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13676-018-0119-x_bib6","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1287\/opre.2017.1624","article-title":"The continuous time service network design problem","volume":"65","author":"Boland","year":"2017","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13676-018-0119-x_bib7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.1040.0183","article-title":"Solving a time-space network formulation for the convoy movement problem","volume":"53","author":"Chardaire","year":"2005","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13676-018-0119-x_bib8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(99)00233-7","article-title":"Service network design in freight transportation","volume":"122","author":"Crainic","year":"2000","journal-title":"Eur J Oper Res"},{"issue":"13","key":"10.1007\/s13676-018-0119-x_bib9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","article-title":"Bundle-based relaxation methods for multicommodity capacitated fixed charge network design","volume":"112","author":"Crainic","year":"2001","journal-title":"Discrete Appl Math"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib10","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1287\/ijoc.1100.0432","article-title":"A time bucket formulation for the traveling salesman problem with time windows","volume":"24","author":"Dash","year":"2010","journal-title":"INFORMS J Comput"},{"issue":"5","key":"10.1007\/s13676-018-0119-x_bib11","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","article-title":"Note on the complexity of the shortest path models for column generation in vrptw","volume":"42","author":"Dror","year":"1994","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-018-0119-x_bib12","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1287\/trsc.1120.0441","article-title":"Improved load plan design through integer programming based local search","volume":"47","author":"Erera","year":"2012","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13676-018-0119-x_bib13","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","article-title":"An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems","volume":"44","author":"Feillet","year":"2004","journal-title":"Networks"},{"issue":"3","key":"10.1007\/s13676-018-0119-x_bib14","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","article-title":"Constructing maximal dynamic flows from static flows","volume":"6","author":"Ford","year":"1958","journal-title":"Oper Res"},{"key":"10.1007\/s13676-018-0119-x_bib15","series-title":"Resource constrained shortest paths and extension","author":"Garcia","year":"2009"},{"issue":"1\u20133","key":"10.1007\/s13676-018-0119-x_bib16","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01585938","article-title":"The fleet assignment problem: solving a large-scale integer program","volume":"70","author":"Hane","year":"1995","journal-title":"Math Program"},{"key":"10.1007\/s13676-018-0119-x_bib17","series-title":"The continuous time service network design problem","author":"Hosseininasab","year":"2015"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib18","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ejor.2016.03.036","article-title":"A service network design model for multimodal municipal solid waste transport","volume":"254","author":"Inghels","year":"2016","journal-title":"Eur J Oper Res"},{"issue":"3","key":"10.1007\/s13676-018-0119-x_bib19","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1287\/opre.1080.0587","article-title":"Large-scale, less-than-truckload service network design","volume":"57","author":"Jarrah","year":"2009","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-018-0119-x_bib20","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1016\/j.ejor.2005.02.030","article-title":"A timespace network based exact optimization model for multi-depot bus scheduling","volume":"175","author":"Kliewer","year":"2006","journal-title":"Eur J Oper Res"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s13160-010-0008-7","article-title":"Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques","volume":"27","author":"Kobayashi","year":"2010","journal-title":"Jpn J Ind Appl Math"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","article-title":"Network design and transportation planning: models and algorithms","volume":"18","author":"Magnanti","year":"1984","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-018-0119-x_bib23","series-title":"Computational Logistics","first-page":"352","article-title":"Service network design of bike sharing systems with resource constraints","author":"Neumann-Saavedra","year":"2016"},{"issue":"Supplement C","key":"10.1007\/s13676-018-0119-x_bib24","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.trb.2016.10.001","article-title":"Robust models for transportation service network design","volume":"94","author":"Ng","year":"2016","journal-title":"Transp Res Part B Methodol"},{"issue":"6","key":"10.1007\/s13676-018-0119-x_bib25","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/S0895-7177(04)90562-6","article-title":"Network design formulations for scheduling u.s. air force channel route missions","volume":"39","author":"Nielsen","year":"2004","journal-title":"Math Comput Model"},{"issue":"3","key":"10.1007\/s13676-018-0119-x_bib26","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.cor.2010.10.031","article-title":"A maritime inventory routing problem: Practical approach","volume":"40","author":"Song","year":"2013","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib27","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.tre.2009.07.003","article-title":"A decomposition scheme for large-scale service network design with asset management","volume":"46","author":"Teypaz","year":"2010","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"3.4","key":"10.1007\/s13676-018-0119-x_bib28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1147\/rd.513.0325","article-title":"Multicommodity network flow approach to the railroad crew-scheduling problem","volume":"51","author":"Vaidyanathan","year":"2007","journal-title":"IBM J Res Dev"},{"issue":"2","key":"10.1007\/s13676-018-0119-x_bib29","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0965-8564(00)00037-9","article-title":"Local truckload pickup and delivery with hard time window constraints","volume":"36","author":"Wang","year":"2002","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib30","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cie.2008.04.011","article-title":"On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints","volume":"56","author":"Wang","year":"2009","journal-title":"Comput Ind Eng"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib31","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00291-007-0079-2","article-title":"Service network design for freight transportation: a review","volume":"30","author":"Wieberneit","year":"2007","journal-title":"OR Spectr"},{"issue":"1","key":"10.1007\/s13676-018-0119-x_bib32","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/02533839.2007.9671231","article-title":"A timespace network model for work team scheduling after a major disaster","volume":"30","author":"Yan","year":"2007","journal-title":"J Chin Inst Eng"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-018-0119-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-018-0119-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-018-0119-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:41:50Z","timestamp":1761882110000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["S2192437620300327"],"URL":"https:\/\/doi.org\/10.1007\/s13676-018-0119-x","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The price of discretizing time: a study in service network design","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-018-0119-x","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2018 \u00a9 2018 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"}]}}