The Quadratic Assignment Problem
暂无分享,去创建一个
[1] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[2] Manfred Padberg,et al. Location, Scheduling, Design and Integer Programming , 2011, J. Oper. Res. Soc..
[3] Vittorio Maniezzo,et al. The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..
[4] Eranda Çela,et al. The quadratic assignment problem : theory and algorithms , 1999 .
[5] Peter Hahn,et al. Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation , 1998, Oper. Res..
[6] Franz Rendl,et al. On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel , 1998, Comput. Optim. Appl..
[7] Qing Zhao. Semidefinite programming for assignment and partitioning problems , 1998 .
[8] Panos M. Pardalos,et al. A GRASP for the biquadratic assignment problem , 1998, Eur. J. Oper. Res..
[9] Gerhard J. Woeginger,et al. A solvable case of the quadratic assignment problem , 1998, Oper. Res. Lett..
[10] Jens Clausen,et al. Solving Large Quadratic Assignment Problems in Parallel , 1997, Comput. Optim. Appl..
[11] Franz Rendl,et al. QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..
[12] Jens Clausen,et al. Joining forces in solving large-scale quadratic assignment problems in parallel , 1997, Proceedings 11th International Parallel Processing Symposium.
[13] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[14] Rainer E. Burkard,et al. Perspectives of Monge Properties in Optimization , 1996, Discret. Appl. Math..
[15] Panos M. Pardalos,et al. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP , 1996, TOMS.
[16] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[17] Franz Rendl,et al. Lower bounds for the quadratic assignment problem via triangle decompositions , 1995, Math. Program..
[18] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[19] José D. P. Rolim,et al. Parallel Algorithms for Irregular Problems: State of the Art , 1995, Springer US.
[20] Zvi Drezner,et al. Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming , 1995, Oper. Res..
[21] R. Burkard,et al. Heuristics for biquadratic assignment problems and their computational comparison , 1995 .
[22] I. Z. Milis,et al. A Lagrangian relaxation algorithm for sparse quadratic assignment problems , 1995, Oper. Res. Lett..
[23] M. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[24] Catherine Roucairol,et al. A New Exact Algorithm for the Solution of Quadratic Assignment Problems , 1994, Discret. Appl. Math..
[25] Arvind Rajan,et al. Using grasp to solve the component grouping problem , 1994 .
[26] Panos M. Pardalos,et al. Lower bounds for the quadratic assignment problem , 1994, Ann. Oper. Res..
[27] Jadranka Skorin-Kapov,et al. Extensions of a tabu search adaptation to the quadratic assignment problem , 1994, Comput. Oper. Res..
[28] Mauricio G. C. Resende,et al. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..
[29] R. F. Vaz,et al. Quadratic assignment problems generated with the Palubetskis algorithm are degenerate , 1994 .
[30] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[31] Panos M. Pardalos,et al. The maximum clique problem , 1994, J. Glob. Optim..
[32] Jadranka Skorin-Kapov,et al. Massively parallel tabu search for the quadratic assignment problem , 1993, Ann. Oper. Res..
[33] J. G. Klincewicz,et al. Avoiding local optima in thep-hub location problem using tabu search and GRASP , 1993, Ann. Oper. Res..
[34] Panos M. Pardalos,et al. Generating quadratic assignment test problems with known optimal permutations , 1992, Comput. Optim. Appl..
[35] Franz Rendl,et al. A New Lower Bound Via Projection for the Quadratic Assignment Problem , 1992, Math. Oper. Res..
[36] H. Wolkowicz,et al. Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality , 1992 .
[37] Franz Rendl,et al. Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem , 1992, Math. Program..
[38] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..
[39] Wansoo T. Rhee. Stochastic Analysis of the Quadratic Assignment Problem , 1991, Math. Oper. Res..
[40] Mihalis Yannakakis,et al. Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..
[41] M. Padberg,et al. Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut , 1990 .
[42] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.
[43] G. S. Palubetski. A generator of test quadratic assignment problems with known optimal solution , 1990 .
[44] Franz Rendl,et al. Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques , 1990, IPCO.
[45] David Connolly. An improved annealing scheme for the QAP , 1990 .
[46] Hanif D. Sherali,et al. Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems , 1990, Oper. Res..
[47] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..
[48] P. Chrétienne. A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints , 1989 .
[49] Nicos Christofides,et al. An Exact Algorithm for the Quadratic Assignment Problem on a Tree , 1989, Oper. Res..
[50] Alan M. Frieze,et al. Algorithms for assignment problems on an array processor , 1989, Parallel Comput..
[51] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[52] Panos M. Pardalos,et al. A parallel algorithm for the quadratic assignment problem , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).
[53] Wansoo T. Rhee. A note on asymptotic properties of the quadratic assignment problem , 1988 .
[54] Gilbert Laporte,et al. Balancing hydraulic turbine runners: A quadratic assignment problem , 1988 .
[55] Catherine Roucairol,et al. A parallel branch and bound algorithm for the quadratic assignment problem , 1987, Discret. Appl. Math..
[56] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[57] T. L. Ward,et al. Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .
[58] Warren P. Adams,et al. A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .
[59] Jack W. Mosevich,et al. Balancing hydraulic turbine runners--A discrete combinatorial optimization problem , 1986 .
[60] Martin E. Dyer,et al. On linear programs with random costs , 1986, Math. Program..
[61] M. Queyranne. Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems , 1986 .
[62] A. Assad,et al. On lower bounds for a class of quadratic 0, 1 programs , 1985 .
[63] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[64] Christos H. Papadimitriou,et al. The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[65] Rainer E. Burkard,et al. Probabilistic asymptotic properties of some combinatorial optimization problems , 1985, Discret. Appl. Math..
[66] F. Rendl. Ranking scalar products to improve bounds for the quadratic assignment problem , 1985 .
[67] Alexander H. G. Rinnooy Kan,et al. Asymptotic Properties of the Quadratic Assignment Problem , 1985, Math. Oper. Res..
[68] Egon Balas,et al. Nonlinear 0–1 programming: I. Linearization techniques , 1984, Math. Program..
[69] F. Rendl,et al. A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .
[70] Charles R. Johnson,et al. Positive definite completions of partial Hermitian matrices , 1984 .
[71] R. Burkard. Quadratic Assignment Problems , 1984 .
[72] Rainer E. Burkard,et al. The asymptotic probabilistic behaviour of quadratic sum assignment problems , 1983, Z. Oper. Research.
[73] David H. West,et al. Algorithm 608: Approximate Solution of the Quadratic Assignment Problem , 1983, TOMS.
[74] R. Burkard,et al. A heuristic for quadratic Boolean programs with applications to quadratic assignment problems , 1983 .
[75] M. Bazaraa,et al. A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .
[76] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[77] Egon Balas,et al. Nonlinear 0–1 programming: II. Dominance relations and algorithms , 1983, Math. Program..
[78] Rainer E. Burkard,et al. On random quadratic bottleneck assignment problems , 1982, Math. Program..
[79] Hanif D. Sherali,et al. On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem , 1982 .
[80] R. Burkard,et al. Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .
[81] H. Sherali,et al. Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem , 1980 .
[82] C. Jochum,et al. Neue Anwendungsgebiete für Computer in der Chemie , 1979 .
[83] L. Kaufman,et al. An algorithm for the quadratic assignment problem using Bender's decomposition , 1978 .
[84] Rainer E. Burkard,et al. An algebraic approach to assignment problems , 1977, Math. Program..
[85] Rainer E. Burkard,et al. Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme , 1977, Math. Methods Oper. Res..
[86] Arthur M. Geoffrion,et al. Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach , 1976, Oper. Res..
[87] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[88] F. Glover. IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS , 1975 .
[89] A. M. Geoffrion. Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .
[90] John W. Dickey,et al. Campus building arrangement using topaz , 1972 .
[91] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[92] Harold Greenberg,et al. A quadratic assignment problem without column constraints , 1969 .
[93] Katta G. Murty,et al. Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..
[94] Thomas E. Vollmann,et al. An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..
[95] W. Leontief. Input-output economics , 1967 .
[96] J. W. Gavett,et al. The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..
[97] A. H. Land,et al. A Problem of Assignment with Inter-Related Costs , 1963 .
[98] P. Gilmore. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .
[99] L. Mirsky,et al. The spread of a matrix , 1956 .
[100] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[101] B. Bollobás,et al. Extremal Graph Theory , 2013 .
[102] V. Deineko,et al. The Quadratic Assignment Problem: Theory and Algorithms , 1998 .
[103] Panos M. Pardalos,et al. Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem , 1997, SIAM J. Optim..
[104] Corso Elvezia. Ant Colonies for the QAP , 1997 .
[105] Panos M. Pardalos,et al. Algorithm : FORTRAN Subroutines for Approximate Solution of Dense Quadratic Assignment Problems using GRASP , 2008 .
[106] V. Kaibel,et al. Angewandte Mathematik Und Informatik Universit at Zu K Oln a Basic Study of the Qap-polytope , 1996 .
[107] Panos M. Pardalos,et al. Approximate solution of weighted MAX-SAT problems using GRASP , 1996, Satisfiability Problem: Theory and Applications.
[108] Gerhard J. Woeginger,et al. Optimierung Und Kontrolle Projektbereich Diskrete Optimierung the Quadratic Assignment Problem with an Anti-monge Matrix and a Toeplitz Matrix: Easy and Hard Cases the Quadratic Assignment Problem with an Anti-monge and a Toeplitz Matrix: Easy and Hard Cases , 1995 .
[109] Alice E. Smith,et al. A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..
[110] Panos M. Pardalos,et al. A Parallel Grasp Implementation for the Quadratic Assignment Problem , 1995 .
[111] Wojciech Szpankowski,et al. Combinatorial optimization problems for which almost every algorithm is asymptotically optimal , 1995 .
[112] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[113] P. Pardalos,et al. The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.
[114] Jadranka Skorin-Kapov,et al. A Constructive Method to Improve Lower Bounds for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.
[115] Charles Fleurent,et al. Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.
[116] Federico Malucelli,et al. A Reformulation Scheme and New Lower Bounds for the QAP , 1993, Quadratic Assignment and Related Problems.
[117] Warren P. Adams,et al. Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem , 1993, Quadratic Assignment and Related Problems.
[118] Panos M. Pardalos,et al. A local search algorithm for the quadratic assignment problem , 1992 .
[119] Federico Malucelli,et al. A New Lower Bound for the Quadratic Assignment Problem , 1992, Oper. Res..
[120] Marco Dorigo,et al. Optimization, Learning and Natural Algorithms , 1992 .
[121] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[122] T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout , 1990 .
[123] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .
[124] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[125] Lawrence Davis,et al. Genetic Algorithms and Simulated Annealing , 1987 .
[126] Giorgio Gallo,et al. Lower bounds for the quadratic semi-assignment problem , 1986 .
[127] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[128] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .
[129] Michael Jünger,et al. Polyhedral combinatorics and the acyclic subdigraph problem , 1985 .
[130] Rainer E. Burkard,et al. Combinatorial optimization in linearly ordered semimodules: A survey , 1982 .
[131] Nicos Christofides,et al. A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem , 1981 .
[132] Alexander Graham,et al. Kronecker Products and Matrix Calculus: With Applications , 1981 .
[133] C. S. Edwards. A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem , 1980 .
[134] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[135] Jakob Krarup,et al. Computer-aided layout design , 1978 .
[136] Harold S. Stone,et al. Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.
[137] A. N. Elshafei,et al. Hospital Layout as a Quadratic Assignment Problem , 1977 .
[138] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[139] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[140] K. Conrad. Das quadratische Zuweisungsproblem und zwei seiner Spezialfaelle , 1971 .
[141] K. G. Murty. An Algorithm for Ranking All the Assignment in Order of Increasing Cost , 1968 .
[142] Rudolf Henn,et al. Operations Research-Verfahren , 1963 .
[143] Leon Steinberg,et al. The Backboard Wiring Problem: A Placement Algorithm , 1961 .
[144] T. Koopmans,et al. Assignment Problems and the Location of Economic Activities , 1957 .
[145] J. P. Secrétan,et al. Der Saccus endolymphaticus bei Entzündungsprozessen , 1944 .