{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T02:27:21Z","timestamp":1651372041078},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,9,27]],"date-time":"2012-09-27T00:00:00Z","timestamp":1348704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10287-012-0154-2","type":"journal-article","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T17:09:17Z","timestamp":1348679357000},"page":"531-542","source":"Crossref","is-referenced-by-count":2,"title":["Network design for time-constrained delivery using subgraphs"],"prefix":"10.1007","volume":"9","author":[{"given":"Hui","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ann M.","family":"Campbell","sequence":"additional","affiliation":[]},{"given":"Barrett W.","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,27]]},"reference":[{"key":"154_CR1","first-page":"161","volume":"36","author":"L Caccetta","year":"2001","unstructured":"Caccetta L, Hartman IBA, Huang J (2001) Concerning the number of edges in a graph with diameter constraints. J Comb Math Comb Comput 36:161\u2013173","journal-title":"J Comb Math Comb Comput"},{"key":"154_CR2","unstructured":"Chen H (2008) Network-design for time-constrained delivery. PhD thesis, The University of Iowa, Tippie College of Business"},{"issue":"6","key":"154_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/nav.20302","volume":"55","author":"H Chen","year":"2008","unstructured":"Chen H, Campbell AM, Thomas BW (2008) Network-design for time-constrained delivery. Naval Res Logist 55(6):493\u2013515","journal-title":"Naval Res Logist"},{"issue":"3","key":"154_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1002\/net.20313","volume":"54","author":"H Chen","year":"2009","unstructured":"Chen H, Campbell AM, Thomas BW, Tamir A (2009) Minimax flow tree problems. Networks 54(3): 117\u2013129","journal-title":"Networks"},{"key":"154_CR5","doi-asserted-by":"crossref","unstructured":"Chen H, Campbell A, Thomas B (2012) Online supplementary materials for network design for time-constrained delivery using subgraphs. Online at Computational Management Science website","DOI":"10.1007\/s10287-012-0154-2"},{"key":"154_CR6","unstructured":"Daskin MS (1997) 150 U.S. largest cities. http:\/\/users.iems.northwestern.edu\/msdaskin\/"},{"key":"154_CR7","unstructured":"Datamonitor (2010) Express logistics in the united states. http:\/\/www.fastmr.com\/prod\/66006_logistics_in_the_united_states.aspx"},{"key":"154_CR8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"DS Johnson","year":"1978","unstructured":"Johnson DS, Lenstra JK, Kan AHGR (1978) The complexity of the network design problem. Networks 8:279\u2013285","journal-title":"Networks"},{"key":"154_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0167-6377(92)90007-P","volume":"11","author":"CL Li","year":"1992","unstructured":"Li CL, Mccormick ST, Simchi-Levi D (1992) On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper Res Lett 11:303\u2013308","journal-title":"Oper Res Lett"},{"key":"154_CR10","unstructured":"Maurits de Jonge J (2008) No break in the storm. Traffic World"},{"key":"154_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.3230110110","volume":"11","author":"J Plesn\u00edk","year":"1981","unstructured":"Plesn\u00edk J (1981) The complexity of designing a network with minimum diameter. Networks 11:77\u201385","journal-title":"Networks"},{"key":"154_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190080102","volume":"8","author":"J Plesn\u00edk","year":"1984","unstructured":"Plesn\u00edk J (1984) On the sum of all distances in a graph or digraph. J Graph Theory 8:1\u201321","journal-title":"J Graph Theory"},{"key":"154_CR13","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1109\/TNET.2005.860100","volume":"13","author":"E Rosenberg","year":"2005","unstructured":"Rosenberg E (2005) Hierarchical topological network design. IEEE\/ACM Trans Netw 13:1402\u20131409","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"10","key":"154_CR14","first-page":"24","volume":"21","author":"KE Thuermer","year":"2008","unstructured":"Thuermer KE (2008) Tweaking the supply chain to optimize value and minimize cost. World Trade 21(10):24","journal-title":"World Trade"},{"key":"154_CR15","unstructured":"United Parcel Service (2011) U.S. ground maps for calculating service time and cost. http:\/\/www.ups.com\/maps?loc=en_US&WT.svl=SubNav , accessed on June 23, 2011"},{"key":"154_CR16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1002\/net.10019","volume":"39","author":"BY Wu","year":"2002","unstructured":"Wu BY, Chao KM, Tang CY (2002) Light graphs with small routing cost. Networks 39:130\u2013138","journal-title":"Networks"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-012-0154-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-012-0154-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-012-0154-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T03:09:02Z","timestamp":1562209742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-012-0154-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,27]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s10287-012-0154-2","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,27]]}}}