{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T01:17:39Z","timestamp":1778548659600,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T00:00:00Z","timestamp":1542758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10479-018-3092-8","type":"journal-article","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T08:12:05Z","timestamp":1542787925000},"page":"173-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0\u20131 optimization problems with linear constraints"],"prefix":"10.1007","volume":"286","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4084-434X","authenticated-orcid":false,"given":"Monique","family":"Guignard","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"issue":"3","key":"3092_CR1","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","volume":"180","author":"WP Adams","year":"2007","unstructured":"Adams, W. P., Guignard, M., Hahn, P. M., & Hightower, W. L. (2007). A Level-2 Reformulation-Linearization technique bound for the quadratic assignment problem. European Journal of Operational Research,180(3), 983\u2013996.","journal-title":"European Journal of Operational Research"},{"key":"3092_CR2","first-page":"43","volume":"16","author":"WP Adams","year":"1994","unstructured":"Adams, W. P., & Johnson, T. A. (1994). Improved linear programming-based lower bounds for quadratic assignment problems. Discrete Mathematics & Theoretical Computer Science,16, 43\u201377.","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"issue":"10","key":"3092_CR3","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams, W. P., & Sherali, H. D. (1986). A tight linearization and an algorithm for zero-one quadratic programming problems. Management Science,32(10), 1274\u20131290.","journal-title":"Management Science"},{"key":"3092_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-004-1708-4","volume":"125","author":"C Beltran","year":"2005","unstructured":"Beltran, C., & Heredia, F. J. (2005). An effective line search for the subgradient method. Journal of Optimization Theory and Applications,125, 1\u201318.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3092_CR5","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","volume":"92","author":"A Billionnet","year":"1996","unstructured":"Billionnet, A., & Calmels, F. (1996). Linear programming for the 0\u20131 quadratic knapsack problem. European Journal of Operational Research,92, 310\u2013325.","journal-title":"European Journal of Operational Research"},{"key":"3092_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10957-014-0561-3","volume":"164","author":"MA Bragin","year":"2015","unstructured":"Bragin, M. A., Luh, P. B., Yan, J. H., Yu, N., & Stern, G. A. (2015). Convergence of the surrogate Lagrangian relaxation method. Journal of Optimization Theory and Applications,164, 173\u2013201.","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"3092_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Pisinger, D., & Toth, P. (1999). Exact solution of the quadratic knapsack problem. INFORMS Journal on Computing,11(2), 125\u2013137.","journal-title":"INFORMS Journal on Computing"},{"key":"3092_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-005-3444-z","volume":"139","author":"Z Drezner","year":"2005","unstructured":"Drezner, Z., Hahn, P., & Taillard, E. (2005). Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods. Annals of Operations Research,139, 65\u201394.","journal-title":"Annals of Operations Research"},{"key":"3092_CR9","first-page":"5","volume":"4","author":"R Fortet","year":"1959","unstructured":"Fortet, R. (1959). L\u2019Alg\u00e8bre de Boole et ses applications en recherche op\u00e9rationnelle. Cahiers Centre Etudes Rech Op\u00e9r,4, 5\u201336.","journal-title":"Cahiers Centre Etudes Rech Op\u00e9r"},{"key":"3092_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A. M. (1974). Lagrangean relaxation for integer programming. Mathematical Programming Study,2, 82\u2013114.","journal-title":"Mathematical Programming Study"},{"issue":"1","key":"3092_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1080\/05695557808975181","volume":"10","author":"AM Geoffrion","year":"1978","unstructured":"Geoffrion, A. M., & McBride, R. (1978). Lagrangean relaxation applied to capacitated facility location problems. AIIE Transactions,10(1), 40\u201347.","journal-title":"AIIE Transactions"},{"issue":"2","key":"3092_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard, M. (2003). \u201cLagrangean relaxation\u201d, invited survey. TOP,11(2), 151\u2013228.","journal-title":"TOP"},{"key":"3092_CR13","unstructured":"Guignard, M. (2006). RLT1 and LR for the GQAP. OPIM Department Research Report 06-06-01, the Wharton School, University of Pennsylvania."},{"key":"3092_CR14","unstructured":"Guignard, M., Hahn, P., Pessoa, A. A., & DaSilva, D. C. (2012). Algorithms for the cross-dock door assignment problem. In Proceedings of 4th international workshop model-based metaheuristics, Angra dos Reis, Brazil (pp. 1\u201312)."},{"issue":"2","key":"3092_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M Guignard","year":"1987","unstructured":"Guignard, M., & Kim, S. (1987). Lagrangean decomposition: A model yielding stronger bounds. Mathematical Programming,39(2), 215\u2013228.","journal-title":"Mathematical Programming"},{"key":"3092_CR16","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10589-007-9093-1","volume":"40","author":"PM Hahn","year":"2008","unstructured":"Hahn, P. M., Kim, B.-J., Guignard, M., Smith, J., & Zhu, Y.-R. (2008). An algorithm for the generalized quadratic assignment problem. Computational Optimization and Applications,40, 351\u2013372.","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"3092_CR17","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/ijoc.1110.0450","volume":"24","author":"PM Hahn","year":"2012","unstructured":"Hahn, P. M., Zhu, Y.-R., Guignard, M., & Hightower, W. L. (2012). A level-3 reformulation-linearization technique bound for the quadratic assignment problem. INFORMS Journal on Computing,24(2), 202\u2013209.","journal-title":"INFORMS Journal on Computing"},{"key":"3092_CR18","unstructured":"Kim, B.-J. (2006). Investigation of methods for solving new classes of quadratic assignment problems (QAPs). Doctoral Dissertation, University of Pennsylvania, ESE Department."},{"key":"3092_CR19","unstructured":"Lee, C.-G., & Ma, Z. (2004). The generalized quadratic assignment problem. Research Report, Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario, M5S 3G8, Canada."},{"issue":"1","key":"3092_CR20","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2010.10.027","volume":"39","author":"L L\u00e9tocart","year":"2012","unstructured":"L\u00e9tocart, L., Nagih, A., & Plateau, G. (2012). Reoptimization in Lagrangian methods for the 0\u20131 quadratic knapsack problem. Computers & OR,39(1), 12\u201318.","journal-title":"Computers & OR"},{"key":"3092_CR21","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P. M., & Querido, T. (2007). A survey for the quadratic assignment problem. European Journal of Operational Research,176, 657\u2013690.","journal-title":"European Journal of Operational Research"},{"key":"3092_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G. P. (1976). Computability of global solutions to factorable nonconvex programs: Part 1 Convex underestimating problems. Mathematical Programming,10, 147\u2013175.","journal-title":"Mathematical Programming"},{"key":"3092_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1379-3","volume-title":"Location, scheduling, design and integer programming","author":"M Padberg","year":"1996","unstructured":"Padberg, M., & Rijal, M. P. (1996). Location, scheduling, design and integer programming. Norwell, MA: Kluwer Academic."},{"key":"3092_CR24","unstructured":"Park, J. (2014). Generalized quadratic assignment problem: Combining level 1 Lagrangean decomposition and reformulation-linearization technique. Independent Study Report, University of Pennsylvania, ESE Department."},{"key":"3092_CR25","unstructured":"Park, J., & Guignard, M. (2018). Computing bounds for CDAP problems using RLT1+LR+ILP decomposition. Research Report, OID Department, University of Pennsylvania, 2018."},{"issue":"1","key":"3092_CR26","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2010.02.006","volume":"206","author":"AA Pessoa","year":"2010","unstructured":"Pessoa, A. A., Hahn, P. M., Guignard, M., & Zhu, Y.-R. (2010). Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. European Journal of Operational Research,206(1), 54\u201363.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3092_CR27","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H. D., & Adams, W. P. (1990). A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics,3(3), 411\u2013430.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"3092_CR28","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0360-8352(92)90117-3","volume":"23","author":"LY Tsui","year":"1992","unstructured":"Tsui, L. Y., & Chang, C.-H. (1992). An optimal solution to a dock door assignment problem. Computer and Industrial Engineering,23(1), 283\u2013286.","journal-title":"Computer and Industrial Engineering"},{"issue":"3","key":"3092_CR29","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1023\/A:1022646725208","volume":"100","author":"X Zhao","year":"1999","unstructured":"Zhao, X., Luh, P. B., & Wang, J. (1999). Surrogate gradient algorithm for Lagrangian Relaxation. Journal of Optimization Theory and Applications,100(3), 699\u2013712.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3092_CR30","unstructured":"Zhu, Y.-R. (2007). Recent advances and challenges in quadratic assignment and related problems. Doctoral Dissertation, University of Pennsylvania, ESE Department."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3092-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3092-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3092-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,6]],"date-time":"2020-02-06T13:20:59Z","timestamp":1580995259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3092-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,21]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["3092"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3092-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,21]]},"assertion":[{"value":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}