乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T23:10:51Z","timestamp":1720825851863},"reference-count":32,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":[[2000,4]]},"DOI":"10.1016\/s0377-2217(99)00235-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:48:22Z","timestamp":1027619302000},"page":"310-328","source":"Crossref","is-referenced-by-count":44,"title":["A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles"],"prefix":"10.1016","volume":"122","author":[{"given":"Stefan","family":"Irnich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00235-0_BIB1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/trsc.3.1.53","article-title":"A column generation algorithm for the ship scheduling algorithm","volume":"3","author":"Appelgren","year":"1969","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02257777","article-title":"Finding maximum cliques in arbitrary and in special graphs","volume":"46","author":"Babel","year":"1991","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01415983","article-title":"A branch and bound algorithm for the maximum clique problem","volume":"34","author":"Babel","year":"1990","journal-title":"ZOR \u2013 Methods and Models of Operations Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","article-title":"Set covering algorithms using cutting planes heuristics and subgradient optimization a computational study","volume":"12","author":"Balas","year":"1980","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB5","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: Column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB6","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1287\/opre.44.6.852","article-title":"Air network design for express shipment service","volume":"44","author":"Barnhart","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB7","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library distributing test problems by electronic mail","volume":"40","author":"Beasley","year":"1990","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","article-title":"An algorithm for the set covering algorithm","volume":"31","author":"Beasley","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","article-title":"A Lagrangian heuristic for the set-covering problem","volume":"37","author":"Beasley","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB10","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","article-title":"A genetic algorithm for the set covering problem","volume":"94","author":"Beasley","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","article-title":"Enhancing an algorithm for the set covering problem","volume":"58","author":"Beasley","year":"1992","journal-title":"Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/opre.45.2.295","article-title":"On the effectiveness of set covering formulations for the vehicle routing problem with time windows","volume":"45","author":"Bramel","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB13","unstructured":"K. B\u00fcdenbender, T. Gr\u00fcnert, H.-J. Sebastian, A tabu search algorithm for the direct flight network design problem, Working Paper 98\/14, Department of Operations Research, Rheinisch-Westf\u00e4lische Technische Hochschule Aachen, 1998"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB14","doi-asserted-by":"crossref","unstructured":"A. Caprara, M. Fischetti, P. Toth, A heuristic algorithm for the set covering problem, in: W.H. Cunningham, S.T. McCormick, M. Queyranne (Eds.), Proceedings of the Fifth IPCO, Lecture Notes in Computer Science 1084, Springer, Berlin, 1996, pp. 72\u201381","DOI":"10.1007\/3-540-61310-2_6"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB15","doi-asserted-by":"crossref","unstructured":"A. Caprara, M. Fischetti, P. Toth, A heuristic algorithm for the set covering problem, Working Paper, DEIS, University of Bologna, Italy, 1996","DOI":"10.1007\/3-540-61310-2_6"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB16","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/net.3230140406","article-title":"Routing with time windows by column generation","volume":"14","author":"Desrosiers","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB17","series-title":"Fleet Management and Logistics","first-page":"57","article-title":"A unified framework for deterministic time constrained vehicle routing and crew scheduling problems","author":"Desaulniers","year":"1998"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB18","series-title":"Fleet Management and Logistics","first-page":"169","article-title":"Crew scheduling in air transportation","author":"Desaulniers","year":"1998"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB19","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pickup and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB20","unstructured":"A. Eremeev, A genetic algorithm with a non-binary representation for the set covering problem, working paper, Omsk Branch of Sobolev Institute of Mathematics, RAS, 1998"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB21","series-title":"Computers and Intractibility: A Guide to NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB22","doi-asserted-by":"crossref","unstructured":"T. Gr\u00fcnert, H.-J. Sebastian, M. Th\u00e4rigen, The design of a letter-mail transportation network by intelligent techniques, in: R. Sprague (Ed.), Proceedings of the Hawaii International Conference On System Sciences, 1999","DOI":"10.1109\/HICSS.1999.772628"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB23","unstructured":"T. Gr\u00fcnert, H.-J. Sebastian, Planning models for long-haul operations of postal and express shipment companies, Working Paper, Department of Operations Research, Rheinisch-Westf\u00e4lische Technische Hochschule Aachen, 1998"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB24","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0377-2217(96)00050-1","article-title":"A simple Lagrangean heuristic for the set covering problem","volume":"97","author":"Haddadi","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB25","unstructured":"S. Irnich, Modellierungs eines Tourenplanungsprobems als Set Covering Problem und Implementierung eines heuristischen L\u00f6sungsverfahrens, Internal Paper, Elite Foundation, 1998"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB26","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB27","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB28","unstructured":"D.M.Ryan, B.A. Foster, Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, in: An Integer Programming Approach to Scheduling, 1981, North-Holland, Amsterdam, pp. 269\u2013280"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB29","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/opre.42.1.41","article-title":"A column generation approach to the multiple-depot vehicle scheduling problem","volume":"42","author":"Ribeiro","year":"1994","journal-title":"Operation Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB30","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","article-title":"A branch-and-price algorithm for the generalized assignment problem","volume":"45","author":"Savelsbergh","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB31","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00235-0_BIB32","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","article-title":"DRIVE: Dynamic routing of independent vehicles","volume":"46","author":"Savelsbergh","year":"1998","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002350?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002350?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T17:59:58Z","timestamp":1579024798000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0377221799002350"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00235-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}