乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:22:12Z","timestamp":1735582932210},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"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":[[2012,7]]},"DOI":"10.1016\/j.ejor.2012.01.042","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T09:56:44Z","timestamp":1328003804000},"page":"48-57","source":"Crossref","is-referenced-by-count":28,"title":["New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem"],"prefix":"10.1016","volume":"220","author":[{"given":"Sergio","family":"Garc\u00eda","sequence":"first","affiliation":[]},{"given":"Mercedes","family":"Landete","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Mar\u00edn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.01.042_b0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","article-title":"Network hub location problems: the state of the art","volume":"190","author":"Alumur","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.042_b0015","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/S0377-2217(03)00072-9","article-title":"Preprocessing and cutting for multiple allocation hub location problems","volume":"155","author":"Boland","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.042_b0020","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02060471","article-title":"Location and allocation for distribution systems with transshipments and transportation economies of scale","volume":"40","author":"Campbell","year":"1992","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.01.042_b0025","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"},{"key":"10.1016\/j.ejor.2012.01.042_b0030","series-title":"Facility Location, Applications and Theory","first-page":"373","article-title":"Hub location problems","author":"Campbell","year":"2002"},{"key":"10.1016\/j.ejor.2012.01.042_b0035","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1016\/j.ejor.2005.08.028","article-title":"Solving the uncapacitated multiple allocation hub location problem by means of a dual ascent technique","volume":"179","author":"C\u00e1novas","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.01.042_b0040","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.ejor.2004.09.047","article-title":"New formulations for the uncapacitated multiple allocation hub location problem","volume":"172","author":"C\u00e1novas","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2012.01.042_b0045","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1287\/opre.1110.0965","article-title":"Benders decomposition for large scale uncapacitated hub location","volume":"59","author":"Contreras","year":"2011","journal-title":"Operations Reseach"},{"issue":"2","key":"10.1016\/j.ejor.2012.01.042_b0050","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"},{"key":"10.1016\/j.ejor.2012.01.042_b0055","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 Jounral on Computing"},{"key":"10.1016\/j.ejor.2012.01.042_b0060","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":"1","key":"10.1016\/j.ejor.2012.01.042_b0065","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dam.2003.09.011","article-title":"Adapting polyhedral properties from facility to hub location problems","volume":"145","author":"Hamacher","year":"2004","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.ejor.2012.01.042_b0070","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0966-8349(96)00010-1","article-title":"A dual algorithm for the uncapacitated hub location problem","volume":"4","author":"Klincewicz","year":"1996","journal-title":"Location Science"},{"key":"10.1016\/j.ejor.2012.01.042_b0075","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10898-004-6099-4","article-title":"Uncapacitated Euclidean hub location: Strengthened formulation, new facets and a relax-and-cut algorithm","volume":"33","author":"Mar\u00edn","year":"2005","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.ejor.2012.01.042_b0085","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0966-8349(96)00015-0","article-title":"Hub network design with single and multiple allocation: a computational study","volume":"4","author":"O\u2019Kelly","year":"1996","journal-title":"Location Science"},{"key":"10.1016\/j.ejor.2012.01.042_b0090","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"},{"key":"10.1016\/j.ejor.2012.01.042_b0095","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0377-2217(02)00852-4","article-title":"New facets and a branch-and-cut algorithm for the weighted clique problem","volume":"154","author":"S\u00f8rensen","year":"2004","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:S037722171200080X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722171200080X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T18:53:47Z","timestamp":1543258427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722171200080X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S037722171200080X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.01.042","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}