{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:47:52Z","timestamp":1761292072820},"reference-count":36,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-8191(03)00042-5","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T02:21:32Z","timestamp":1052792492000},"page":"555-574","source":"Crossref","is-referenced-by-count":18,"title":["Solving hub arc location problems on a cluster of workstations"],"prefix":"10.1016","volume":"29","author":[{"given":"James F.","family":"Campbell","sequence":"first","affiliation":[]},{"given":"Gary","family":"Stiehr","sequence":"additional","affiliation":[]},{"given":"Andreas T.","family":"Ernst","sequence":"additional","affiliation":[]},{"given":"Mohan","family":"Krishnamoorthy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00042-5_BIB1","unstructured":"T. Aykin, On modeling scale economies in hub-and-spoke network design, presented at the Fall Conference of INFORMS, Atlanta, Georgia, 1996"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0167-8191(99)00094-0","article-title":"Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem","volume":"26","author":"Bourbeau","year":"2000","journal-title":"Parallel Computing"},{"issue":"4","key":"10.1016\/S0167-8191(03)00042-5_BIB3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1998.tb00405.x","article-title":"Extensions to the hub location problem: Formulations and numerical examples","volume":"30","author":"Bryan","year":"1998","journal-title":"Geographical Analysis"},{"issue":"2","key":"10.1016\/S0167-8191(03)00042-5_BIB4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1111\/1467-9787.00134","article-title":"Hub-and-spoke networks in air transportation: An analytical review","volume":"39","author":"Bryan","year":"1999","journal-title":"Journal of Regional Science"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB5","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1287\/opre.44.6.923","article-title":"Hub location and the p-hub median problem","volume":"44","author":"Campbell","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB6","unstructured":"J.F. Campbell, A.T. Ernst, M. Krishnamoorthy, Hub arc location problems: Part I\u2013\u2013Introduction and results, Management Science, submitted for publication"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB7","unstructured":"J.F. Campbell, A.T. Ernst, M. Krishnamoorthy, Hub arc location problems: Part II\u2013\u2013Formulations and optimal algorithms, Management Science, submitted for publication"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB8","series-title":"Facility Location: Applications and Theory","first-page":"373","article-title":"Hub location problems","author":"Campbell","year":"2002"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.9.1.61","article-title":"Towards a taxonomy of parallel tabu search heuristics","volume":"9","author":"Crainic","year":"1997","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB10","series-title":"Handbook of Transportation Science","first-page":"433","article-title":"Long-haul freight transportation","author":"Crainic","year":"1999"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","article-title":"A simplex-based tabu search method for capacitated network design","volume":"12","author":"Crainic","year":"2000","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB12","series-title":"Network and Discrete Location: Models, Algorithms, and Applications","author":"Daskin","year":"1995"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB13","series-title":"Facility Location: A Survey of Applications and Methods","year":"1995"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB14","series-title":"Facility Location: Applications and Theory","year":"2002"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","article-title":"Efficient algorithms for the uncapacitated single allocation p-hub median problem","volume":"4","author":"Ernst","year":"1996","journal-title":"Location Science"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.10.2.149","article-title":"An exact solution approach based on shortest-paths for p-hub median problems","volume":"10","author":"Ernst","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB17","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/S0167-8191(01)00103-X","article-title":"A dynamic model and parallel tabu search heuristic for real-time ambulance relocation","volume":"27","author":"Gendreau","year":"2001","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB18","first-page":"151","article-title":"Parallel implementations of a branch-and-bound algorithm for multicommodity location with balancing requirements","volume":"31","author":"Gendron","year":"1993","journal-title":"INFOR"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB19","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","article-title":"Parallel branch and bound algorithms: Survey and synthesis","volume":"42","author":"Gendron","year":"1994","journal-title":"Operations Research"},{"issue":"9","key":"10.1016\/S0167-8191(03)00042-5_BIB20","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/S0305-0548(96)00094-9","article-title":"A parallel branch-and-bound algorithm for multicommodity location with balancing requirements","volume":"24","author":"Gendron","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB21","series-title":"Telecommunications Network Planning","first-page":"1","article-title":"Multicommodity capacitated network design","author":"Gendron","year":"1998"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1287\/ijoc.7.4.365","article-title":"Parallel search algorithms for discrete optimization problems","volume":"7","author":"Grama","year":"1995","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB23","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","article-title":"Optimum locations of switching centers and the absolute centers and medians of a graph","volume":"12","author":"Hakimi","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB24","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","article-title":"Optimum distribution of switching centers in a communication network and some related graph theoretic problems","volume":"13","author":"Hakimi","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB25","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0966-8349(98)00042-4","article-title":"Hub location in backbone\/tributary network design: A review","volume":"6","author":"Klincewicz","year":"1998","journal-title":"Location Science"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB26","series-title":"Computational Combinatorial Optimization","article-title":"Branch, Cut, and Price: Sequential and Parallel","author":"Ladanyi","year":"2001"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB27","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":"Transportation Science"},{"issue":"3","key":"10.1016\/S0167-8191(03)00042-5_BIB28","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","article-title":"Network synthesis and optimum network design-problems\u2013\u2013Models, solution methods and applications","volume":"19","author":"Minoux","year":"1989","journal-title":"Networks"},{"issue":"8","key":"10.1016\/S0167-8191(03)00042-5_BIB29","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0191-2615(98)00021-6","article-title":"Hub location with flow economies of scale","volume":"32","author":"O\u2019Kelly","year":"1998","journal-title":"Transportation Research B"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB30","volume":"27","year":"2001","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB31","doi-asserted-by":"crossref","unstructured":"H. Podnar, J. Skorin-Kapov, Genetic algorithm for cost minimization applied to networks with threshold based discounting, Working paper, 1999","DOI":"10.2498\/cit.2000.04.06"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB32","unstructured":"H. Podnar, J. Skorin-Kapov, D. Skorin-Kapov, Network cost minimization using threshold based discounting, Working paper, 1999"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB33","unstructured":"T.K. Ralphs, L. Ladanyi, M.J. Saltzman, Parallel branch and bound for large-scale discrete optimization, working paper available at http:\/\/www.lehigh.edu\/tkr2\/research\/pubs.html, June 13, 2002"},{"issue":"2\u20133","key":"10.1016\/S0167-8191(03)00042-5_BIB34","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","article-title":"On the capacitated vehicle routing problem","volume":"94","author":"Ralphs","year":"2003","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB35","unstructured":"T.K. Ralphs, Parallel branch and cut for capacitated vehicle routing, working paper available at http:\/\/www.lehigh.edu\/tkr2\/research\/pubs.html, June 13, 2002"},{"key":"10.1016\/S0167-8191(03)00042-5_BIB36","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","article-title":"Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms","volume":"27","author":"Rego","year":"2001","journal-title":"Parallel Computing"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000425?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000425?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T12:48:55Z","timestamp":1584535735000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167819103000425"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00042-5","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}