乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T18:01:02Z","timestamp":1718301662355},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf02023001","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T13:49:15Z","timestamp":1123681755000},"page":"359-383","source":"Crossref","is-referenced-by-count":93,"title":["A tabu search procedure for multicommodity location\/allocation with balancing requirements"],"prefix":"10.1007","volume":"41","author":[{"given":"Teodor G.","family":"Crainic","sequence":"first","affiliation":[]},{"given":"Michel","family":"Gendreau","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Soriano","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Toulouse","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02023001_CR1","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"A. Balakrishnan, T.L. Magnanti and R.T. Wong, A dual-ascent procedure for large-scale uncapacitated network design, Oper. Res. 37(1989)716\u2013740.","journal-title":"Oper. Res."},{"key":"BF02023001_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02097809","volume":"18","author":"T.G. Crainic","year":"1989","unstructured":"T.G. Crainic, P.J. Dejax and L. Delorme, Models for multimode multicommodity location problems with interdepot balancing requirements, Ann Oper. Res. 18(1989)279\u2013302.","journal-title":"Ann Oper. Res."},{"key":"BF02023001_CR3","doi-asserted-by":"crossref","unstructured":"T.G. Crainic, L. Delorme and P.J. Dejax, A branch-and-bound method for multicommodity location with balancing requirements, Eur. J. Oper. Res. (1993), to appear.","DOI":"10.1016\/0377-2217(93)90117-6"},{"key":"BF02023001_CR4","doi-asserted-by":"crossref","unstructured":"T.G. Crainic and L. Delorme, Dual-ascent procedures for multicommodity location\/allocation problems with balancing requirements, Transp. Sci. (1993), to appear.","DOI":"10.1287\/trsc.27.2.90"},{"key":"BF02023001_CR5","unstructured":"P.J. Dejax, T.G. Crainic and L. Delorme, Strategic\/tactical planning of container land transportation systems,TIMS XXVIII\/EURO IX Joint Meeting, Paris (1988)."},{"key":"BF02023001_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra de","year":"1989","unstructured":"D. de Werra and A. Hertz, Tabu search techniques \u2014 A tutorial and application to neural networks, OR Spektrum 11(1989)131\u2013141.","journal-title":"OR Spektrum"},{"key":"BF02023001_CR7","unstructured":"M. Gendreau, A. Hertz and G. Laporte, A tabu search heuristic for the vehicle routing problem, Publication #777, Centre de Recherche sur les Transports, Universit\u00e9 de Montr\u00e9al (1991)."},{"key":"BF02023001_CR8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"F. Glover, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res. 13(1986)533\u2013549.","journal-title":"Comput. Oper. Res."},{"key":"BF02023001_CR9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"BF02023001_CR10","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search, Part II, ORSA J. Comput. 2(1990)4\u201332.","journal-title":"ORSA J. Comput."},{"key":"BF02023001_CR11","volume-title":"RNET \u2014 The Rutgers minimum cost network flow subroutines","author":"M.D. Grigoriadis","year":"1979","unstructured":"M.D. Grigoriadis and T. Hsu, RNET \u2014 The Rutgers minimum cost network flow subroutines, Rutgers University, New Brunswick, New Jersey (1979)."},{"key":"BF02023001_CR12","volume-title":"R\u00e9solution heuristique et optimale du probl\u00e8me de localisation de d\u00e9p\u00f4ts avec \u00e9quilibrage","author":"Z.-Y. Guo","year":"1990","unstructured":"Z.-Y. Guo, R\u00e9solution heuristique et optimale du probl\u00e8me de localisation de d\u00e9p\u00f4ts avec \u00e9quilibrage, Ph.D. Thesis, D\u00e9partement de G\u00e9nie Industriel, Ecole Centrale, Paris (1990)."},{"key":"BF02023001_CR13","unstructured":"Z.-Y. Guo, T.G. Crainic and L. Delorme, R\u00e9solution heurestique du probl\u00e8me de localisation-distribution avec \u00e9quilibrage, Logistique\/logistics: Production, distribution, transport\/manufacturing, distribution, transportation,Proc. Conf. on the Practice and Theory of Operations Management and4es journ\u00e9es francophones sur la Logistique et les Transports, AFCET (1989) pp. 87\u201395."},{"key":"BF02023001_CR14","unstructured":"P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Rutcor Research Report 93-87, Rutgers University (1987)."},{"key":"BF02023001_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"J. Skorin-Kapov, Tabu search applied to the quadractic assignment problem, ORSA J. Comput. 2(1990)33\u201345.","journal-title":"ORSA J. Comput."},{"key":"BF02023001_CR16","unstructured":"N. T\u00e9treault, Une approache de restriction bas\u00e9e sur une m\u00e9thode primale-duale pour r\u00e9soudre le probl\u00e8me de localisation-distribution avec \u00e9changes int\u00e9rd\u00e9p\u00f4ts, M.Sc. Thesis, Publication #681, Centre de Recherche sur les Tranports, Universit\u00e9 de Montr\u00e9al (1990)."},{"key":"BF02023001_CR17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M. Widmer","year":"1989","unstructured":"M. Widmer and A. Hertz, A new heuristic for solving the flow shop sequencing problem, Eur. J. Oper. Res. 41(1989)186\u2013193.","journal-title":"Eur. J. Oper. Res."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023001.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023001\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:39:56Z","timestamp":1557787196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02023001"],"URL":"https:\/\/doi.org\/10.1007\/bf02023001","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}