| Автор | Bookhold, Ines |
| Дата выпуска | 1990 |
| dc.description | We discuss special eases of the quadratic assignment problem (QAP) being polynomially solvable. In particular we give an algebraic condition for the cost; Matrices of a QAP which guarantees that it is equivalent with a linear assignment problem. Based on these results we develop an approximation algorithm for QAPs with non-negative symmetric cost matrices. |
| Формат | application.pdf |
| Издатель | Akademic-Verlag |
| Копирайт | Copyright Taylor and Francis Group, LLC |
| Тема | Quadratic assignment problem |
| Тема | linear assignment problem |
| Тема | polynomial solvable special case |
| Тема | approximation algorithm |
| Тема | Primary:90 C 20 |
| Тема | Secondary:90 C 10 |
| Название | A contribution to quadratic assignment problems |
| Тип | research-article |
| DOI | 10.1080/02331939008843626 |
| Electronic ISSN | 1029-4945 |
| Print ISSN | 0233-1934 |
| Журнал | Optimization |
| Том | 21 |
| Первая страница | 933 |
| Последняя страница | 943 |
| Аффилиация | Bookhold, Ines; Sektion Mathematik, Ernst-Moritz-Arndt-Universität |
| Выпуск | 6 |
| Библиографическая ссылка | Bazaraa, M.S. and Elshafei, A.N. 1979. An exact braneh-and-bound procedure for the quadratic assignment problem. Naval Res. Logist. Quart, 26(1): 109–121. |
| Библиографическая ссылка | Bazaraa, M.S. and Sherali, M.D. 1982. On the use of exact and heuristic cutting plane methods for the quadratic assignment problem. J. Oper. Res. Soc, 33(11): 991–1003. |
| Библиографическая ссылка | Bookhold, I. 1988. “Untersuchungen zur Aquivalenz von linearem und quadratischem Zuordnungspriblem”. In Diss. A, Greifswald: Ernst-Moritz-Arndt-Univ. |
| Библиографическая ссылка | Burkard, R.E. 1973. Die Störungsmethode zur Lösung quadratischer Zuordnungspro- bleme. Oper. Res. Yerfahren, 16: 84–108. |
| Библиографическая ссылка | Burkard, R.E. 1975. Heuristische Verfahren zur Losung quadratischer Zuordnungs- probleme. Z. Oper. Res, 19: 183–193. |
| Библиографическая ссылка | Burkard, R.E. 1984. Quadratic assignment problems. European J. Oper. Res, 15: 283–289. |
| Библиографическая ссылка | Burkard, R.E. 1984. “Some recent advances in quadratic assignment problems”. In Mathematical Programming, Edited by: Cottle, R., Kelmanson, M.L. and Korte, B. 53–68. Amsterdam: North Holland. |
| Библиографическая ссылка | Burkard, R.E. and Gerstl, A. 1973. Quadratieche Zuordnungsprobleme III: Testbeispiele und Rechenzeiten, Vol. 65, Bericht: Rechenzentrum Graz. |
| Библиографическая ссылка | Burkard, R.E. and Offermann, J. 1977. Entwurf von Schreibmaschinentastatureii mittels quadratischer Zuordnungsprobleme. Z. Oper. Res, 21: 121–132. |
| Библиографическая ссылка | Burkard, R.E. and Rendl, F. 1914. A thermo dynamically motivated simulation procedure for combinatorial optimization problems. European J. Oper. Res, 17: 169–174. |
| Библиографическая ссылка | Christofides, N. and Gerrard, M. 1981. A graphtheorctic analysis of bounds for the quadratic assignment problem. Ann. Discrete Math, 11: 129–148. |
| Библиографическая ссылка | Conrad, K. 1971. Das quadratische Zuweisungsproblem mid zwoi seiner Spezialfälle, Tübingen. |
| Библиографическая ссылка | Dickey, J.W. and Hopkins, J.W. 1972. Campus building arrangement using TOPAZ. Transportation Research, 6: 59–68. |
| Библиографическая ссылка | Domschke, W. and Drexl, A. 1984. Logistic, München: Standorte. |
| Библиографическая ссылка | Elshafet, A.N. 1977. Hospital lay-out as a quadratic assignment problem. Oper, Res, Quart, 28: 167–179. |
| Библиографическая ссылка | Yemelichev, V.A., Kovaxev, M.M. and Kravtsov, M.K. 1984. Polytopes, Graphs and Optimization, Cambridge Univ. Press. |
| Библиографическая ссылка | Frieze, A.M. and Yadegar, J. 1983. On the quadratic assignment problem. Discrete Appl. Math, 5: 89–98. |
| Библиографическая ссылка | Gaschütz, G.K. and Ahrens, J.H. 1968. Suboptinial algorithms for the quadratic assignment problem. Naval Res. Logist. Quart, 15(1): 49–62. |
| Библиографическая ссылка | Gilmore, P.C. 1962. Optimal and suboptinial algorithms for the quadratic assignment problem. SIAM J. Appl. Math, 10(1): 305–313. |
| Библиографическая ссылка | Graves, G.W. and Whinston, A.B. 1970. An algorithm for the quadratic assignment problem. Integer and nonlinear programming, 10(1): 473–497. |
| Библиографическая ссылка | Kautmann, L. and Broeckx, F. 1978. An algorithm for the quadratic assignment problem. European J. Oper. Res, 2(1): 204–211. |
| Библиографическая ссылка | Koopmans, T.C. and Beckmann, M. 1957. Assignment problems and the location of economic activities, Vol. 25, 53–76. Econometrica Univ. Chicago Press. |
| Библиографическая ссылка | Krarup, J. and Pruzan, P.M. 1978. Computer-aided layout design. Math. Progr. Study, 9: 75–94. |
| Библиографическая ссылка | Lawler, E.L. 1963. The quadratic assignment problem. Management Sci, 9: 586–599. |
| Библиографическая ссылка | Munkres, J. 1957. Algorithms for the assignment and transportation problems. SIAM J. Appl. Math, 5(1): 32–38. |
| Библиографическая ссылка | Pierce, J.F. and Crowston, W.B. 1971. Tree search algorithms for quadratic assignment problems. Naval Res. Logist. Quart, 18(1): 1–36. |
| Библиографическая ссылка | Roucairol, C. 1979. A reduction method for quadratic assignment problems. Oper. Res. Verfahren, 32(1): 183–187. |
| Библиографическая ссылка | Sahni, S. and Gonzalez, T. 1976. P-complete approximation problems. J. Assoc. Comp. Mach, 28(1): 555–556. |
| Библиографическая ссылка | Steinberg, L. 1961. The backboard wiring problem—a placement algorithm. SIAM Review, 8(1): 37–50. |
