{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T20:41:22Z","timestamp":1768682482310,"version":"3.49.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1016\/s0377-2217(03)00072-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"638-653","source":"Crossref","is-referenced-by-count":112,"title":["Preprocessing and cutting for multiple allocation hub location problems"],"prefix":"10.1016","volume":"155","author":[{"given":"Natashia","family":"Boland","sequence":"first","affiliation":[]},{"given":"Mohan","family":"Krishnamoorthy","sequence":"additional","affiliation":[]},{"given":"Andreas T.","family":"Ernst","sequence":"additional","affiliation":[]},{"given":"Jamie","family":"Ebery","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00072-9_BIB1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1018966804496","article-title":"Reformulation of capacitated facility location problems: How redundant information can help","volume":"82","author":"Aardal","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB2","unstructured":"T. Aykin, Networking policies for hub-and-spoke systems with application to the air transportation system. Working paper, Rutgers Graduate School of Management, New Ark, NJ, 1993"},{"issue":"11","key":"10.1016\/S0377-2217(03)00072-9_BIB3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"Or-library: Distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90318-2","article-title":"Integer programming formulations of discrete hub location problems","volume":"72","author":"Campbell","year":"1994","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/S0377-2217(03)00072-9_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\/S0377-2217(03)00072-9_BIB6","unstructured":"CPLEX Optimisation Inc., 930 Tahoc Blvd., Bldg 802, Incline Valley, NV 89451-9436, USA. Using the CPLEX callable library (version 6.0), 1998"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB7","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(99)00370-7","article-title":"Solving large single allocation p-hub problems with two or three hubs","volume":"128","author":"Ebery","year":"2001","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(03)00072-9_BIB8","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0377-2217(98)00395-6","article-title":"The capacitated multiple allocation hub location problem: Formulations and algorithms","volume":"120","author":"Ebery","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB9","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"},{"issue":"1","key":"10.1016\/S0377-2217(03)00072-9_BIB10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0377-2217(96)00340-2","article-title":"Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem","volume":"104","author":"Ernst","year":"1998","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(03)00072-9_BIB11","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\/S0377-2217(03)00072-9_BIB12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","article-title":"Solution algorithms for the capacitated single allocation hub location problem","volume":"86","author":"Ernst","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB13","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero\u2013one linear programming problems","volume":"31","author":"Johnson","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB14","unstructured":"J.G. Klincewicz, Dual algorithms for the uncapacitatcd hub location problem and the p-hub median problem, AT&T Bell Laboratories. Holmdel, NJ 07733, 1994"},{"issue":"6","key":"10.1016\/S0377-2217(03)00072-9_BIB15","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/S0305-0548(01)00080-6","article-title":"Hublocater: An exact solution method for the multiple allocation hub location problem","volume":"29","author":"Mayer","year":"2002","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","article-title":"Minto, a mixed integer optimizer","volume":"15","author":"Nemhauser","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB17","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB18","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(87)80007-3","article-title":"A quadratic integer program for the location of interacting hub facilities","volume":"32","author":"O\u2019Kelly","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB19","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","article-title":"Solving mixed integer programming using automatic reformulation","volume":"35","author":"Van Roy","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00072-9_BIB20","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","article-title":"Tight linear programming relaxations of uncapacitated p-hub median problems","volume":"94","author":"Skorin-Kapov","year":"1996","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000729?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703000729?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:24:09Z","timestamp":1553228649000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703000729"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S0377221703000729"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00072-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}