[1]Koopmans T C, Beckmann M J. Assignment problems and the location of economic activities[J]. Econometrica, 1957, 25: 53-76. [2]Loiola E M, Abreu N M M, Boaventura-Netto P O, et al. A survey for the quadratic assignment problem[J]. Europeam Journal of Operational Research, 2007, 176: 657-690. [3]Steinberg L. The backboard wiring problem: a placement algorithm[J]. SIAM Review, 1961, 3: 37-50. [4]Brixius N W, Anstreicher K M. The Steingberg wiring problem[J]. Gro tschelM, ed. the Sharpest Cut, The Impact of Manfred Padberg and His Work. MPS-SIAM Series on Optimization. SIAM Publisher, 2004, 4: 293-307. [5]ElshafeiA N. Hospital layout as a quadratic assignment problem[J]. Operations Research Quarterly, 1977, 28: 167-179. [6]Carlson R C, Nemhauser G L. Scheduling to minimize interaction cost[J]. Operations Research, 1966, 14: 52-58. [7]魏欣, 马良, 张惠珍.二次分配问题的大洪水算法求解[J].运筹与管理,2011,20(1):1007-3221. [8]张惠珍, 马良.几种基于匈牙利算法求解二次分配问题的方法及其分析比较[J].运筹与管理,2010,19(1):92-99. [9]夏勇.二次指派问题的Gilmore-Lawler界的改进[J].工程数学学报,2007,03:401-413. [10]Akkeles A, Acan A, Unveren A. A fresh view: quadratic assignment problem[J]. Proceedings of the 5th International Congress on Computational Mechanics-GRACM 2005.Limassol, July 2005. 737-744. [11]Drezner Z, Hahn P M, Taillard E D. Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods[J]. Annals of Operations Research, 2005, 139: 65-94. [12]Kaufman L, Broeckx F, An algorithm for the quadratic assignment problem using bender’s decomposition[J]. Europen Journal of Operational Research, 1978, 2: 204-211. [13]Xia Y, Yuan Y. A new linearization method for quadratic assignment prob-lems[J]. Optimization Methods and Software, 2006, 21: 805-818. [14]Lawler E L. The quadratic assignment problem[J]. Management Science, 1963, 9: 586-599. [15]Frieze A M, Yadegar J. On the quadratic assignment problem[J]. Discrete Applied Mathematics, 1983, 5: 89-98. [16]Ramachandran B, Pekny J F. Higher order lifting techniques in the solution of the quadratic assignment problem[J]. Floudas C A, Pardalos P M, eds. State of the art in global optimization: computational methods and applications. Netherlands: Kluwer Academic Publishers, 1996. 75-92. [17]Ramakrishnan K G, Resende M G C, Ramachandran B, et al. Tight QAP bounds via linear programming. Pardalos P M, Migdalas A, Burkard R, eds. Combinatorial and Global Optimization. Singapore[J]. World Scientific Publishing Co. 2002. 297-303. [18]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: 261-278. [19]AL-Khayyal F A, Falk J E. Jointly constrained biconvex programming[J]. Mathematics of Operations Research, 1983, 8: 273-286. [20]AL-Khayyal F A, Larsen C. Global optimization of a quadratic function subject to a bounded mixed integer constraint set[J]. Annals of Operations Research, 1990, 25: 169-180. [21]Sherali H D, Tuncbilek C H. A global optimization algorithm for polynomial programming programs using a reformulation-linearization technique[J]. Journal of Global Optimization, 1992, 2: 101-112. [22]Erdogˇan G, Tansel B. A branch-and-cut algorithm for quadratic assignment problems based on linearizations[J]. Computers and Operations Research, 2007, 34: 1085-1106. [23]McCormick P, Computability of global solution to factorable nonconvex problems: Part I-Convex underestimating problems[J]. Mathematical Programming, 1976, 10: 147-175. |