乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T08:27:31Z","timestamp":1720340851012},"reference-count":18,"publisher":"Elsevier BV","issue":"2","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.02.010","type":"journal-article","created":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T11:59:07Z","timestamp":1329393547000},"page":"314-319","source":"Crossref","is-referenced-by-count":17,"title":["A new exact discrete linear reformulation of the quadratic assignment problem"],"prefix":"10.1016","volume":"220","author":[{"given":"Axel","family":"Nyberg","sequence":"first","affiliation":[]},{"given":"Tapio","family":"Westerlund","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2012.02.010_b0005","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","article-title":"Branching rules revisited","volume":"33","author":"Achterberg","year":"2005","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/j.ejor.2012.02.010_b0010","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","article-title":"A level-2 reformulation\u2013linearization technique bound for the quadratic assignment problem","volume":"180","author":"Adams","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.010_b0015","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s101070100255","article-title":"Solving large quadratic assignment problems on computational grids","volume":"91","author":"Anstreicher","year":"2002","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.02.010_b0020","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","article-title":"Recent advances in the solution of quadratic assignment problems","volume":"97","author":"Anstreicher","year":"2003","journal-title":"Mathematical Programming, Ser. B"},{"key":"10.1016\/j.ejor.2012.02.010_b0025","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/PL00011402","article-title":"A new bound for the quadratic assignment problem based on convex quadratic programming","volume":"89","author":"Anstreicher","year":"2001","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.02.010_b0030","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1008293323270","article-title":"Qaplib \u2013 a quadratic assignment problem library","volume":"10","author":"Burkard","year":"1997","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/j.ejor.2012.02.010_b0035","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-008-0246-5","article-title":"Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem","volume":"122","author":"de Klerk","year":"2010","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2012.02.010_b0040","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s00291-005-0010-7","article-title":"Finding a cluster of points and the grey pattern quadratic assignment problem","volume":"28","author":"Drezner","year":"2006","journal-title":"OR Spectrum"},{"key":"10.1016\/j.ejor.2012.02.010_b0045","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","article-title":"Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods","volume":"139","author":"Drezner","year":"2005","journal-title":"Annals of Operations Research"},{"issue":"12","key":"10.1016\/j.ejor.2012.02.010_b0050","doi-asserted-by":"crossref","first-page":"5742","DOI":"10.1021\/ie8016048","article-title":"Computational comparison of piecewise linear relaxations for pooling problems","volume":"48","author":"Gounaris","year":"2009","journal-title":"Industrial & Engineering Chemistry Research"},{"key":"10.1016\/j.ejor.2012.02.010_b0055","series-title":"Qaplib - a quadratic assignment problem library online","author":"Hahn","year":"2002"},{"key":"10.1016\/j.ejor.2012.02.010_b0060","unstructured":"Hahn, P.M., Zhu, Y.-R., Guignard, M., Hightower, W.L., 2008. A level-3 reformulation-linearization technique based bound for the quadratic assignment problem. Optimization-Online 09. URL ."},{"issue":"3","key":"10.1016\/j.ejor.2012.02.010_b0065","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0377-2217(78)90095-4","article-title":"An algorithm for the quadratic assignment problem using bender\u2019s decomposition","volume":"2","author":"Kaufman","year":"1978","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.02.010_b0070","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","article-title":"Assignment problems and location of economic activities","volume":"25","author":"Koopmans","year":"1957","journal-title":"Econometrica"},{"issue":"2","key":"10.1016\/j.ejor.2012.02.010_b0075","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","article-title":"A survey for the quadratic assignment problem","volume":"176","author":"Loiola","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2012.02.010_b0080","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s12532-010-0012-6","article-title":"A new relaxation framework for quadratic assignment problems based on matrix splitting","volume":"2","author":"Peng","year":"2010","journal-title":"Mathematical Programming Computation"},{"issue":"4\u20135","key":"10.1016\/j.ejor.2012.02.010_b0085","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","article-title":"Robust taboo search for the quadratic assignment problem","volume":"17","author":"Taillard","year":"1991","journal-title":"Parallel Computing"},{"key":"10.1016\/j.ejor.2012.02.010_b0090","unstructured":"Zhang, H., Beltran-Royo, C., Ma, L., 2010. Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers. Statistics and Operations Research, Rey Juan Carlos University (URJC), C\/ Tulip\u00e1n s\/n, 28933, M=stoles (Madrid), Spain 04, 1."}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712001270?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712001270?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T04:24:41Z","timestamp":1543206281000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712001270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["S0377221712001270"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.02.010","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}