Misevicius A. An improved hybrid genetic algorithm: new result for the quadratic assignment Problem [J]. Knowledge-Based Systems, 2004, 17(2-4): 65-73. 张惠珍, 马良. 一类特殊二次分配问题及其求解 [J]. 系统工程, 2008, 26(8): 113-117. Zhang H Z, Beltran-Royo C, Constantino M. Effective formulation reductions for the quadratic assignment problem [J]. Computers & Operations Research, 2010, 37(11): 2007-2016. Kaufman L, Broeckx F. An algorithm for the quadratic assignment problem using Bender's decomposition [J]. European Journal of Operational Research, 1978, 2(3): 204-211. Xia Y, Yuan Y X. A new linearization method for quadratic assignment problems [J]. Optimization Methods and Software, 2006, 21(5): 805-818. Zhang H Z, Beltran-Royo C, Ma L. Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers [J]. Annals of Operations Research, 2013, 207(1): 261-278. Lawler E L. The quadratic assignment problem [J]. Management Science, 1963, 9(4): 586-599. Frieze A M, Yadegar J. On the quadratic assignment problem [J]. Discrete Applied Mathematics, 1983, 5(1): 89-98. Adams W P, Johnson T A. Improved linear programming-based lower bounds for the quadratic assignment problem [C]//Quadratic Assignment and Related Problems. New York: American Mathematical Society, 1994, 16: 43-75. Erdogan G, Tansel B. A branch and cut algorithm for quadratic assignment problems based on linearizations [J]. Computers and Operations Research, 2007, 34(4): 1085-1106. Ramachandran B, Pekny J F. Higher order lifting techniques in the solution of the quadratic assignment problem [C]//State of the Art in Global Optimization: Computational Methods and Applications. Netherlands: Kluwer Academic Publishers, 1996: 75-92. Ramakrishnan K G, Resende M G C, Ramachandran B, et al. Tight QAP bounds via linear programming [C]//Combinatorial and Global Optimization. Singapore: World Scientific Publishing Co. 2002, 297-303. 张惠珍, 马良. 一种求解二次分配问题的新方法 [J]. 系统管理学报, 2010, 19(6): 645-650. |