Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme

Abraitis, L. B.: Algoritm dlja opredelenija maksimal'no swazannych naborow elementow. Awtomatika i wytschislitel'naja technika5, 40–47, 1970 (russisch).Google Scholar

Armour, G. C., undE. S. Buffa: A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities. Man. Sci.9, 294–309, 1963.Google Scholar

Berr, U., undH. E. W. Müller: Ein heuristisches Verfahren zur Raumverteilung in Fabriksanlagen. Elektr. Datenverarbeitung10, H. 4, 200–204, 1968.Google Scholar

Bloch, W.: Maschinenaufstellung nach dem Dreiecksverfahren. Industrielle Organisation19, Nr. 5, 305–308, 1950.Google Scholar

Breuer, M. A.: The Formulation of Some Allocation and Connection Problems as Integer Programs. Naval Res. Log. Quart.13, 83–95, 1966.Google Scholar

Buffa, E. S., G. C. Armour andT. E. Vollmann: Allocating Facilities with “CRAFT”. Harward Business Review42, No. 2, 136–159, 1964.Google Scholar

Burckhardt, W.: Zur Optimierung von räumlichen Zuordnungen. Ablauf- und Planungsforschung10, 233–248, 1969.Google Scholar

Burkard, R. E.: Quadratische Zuordnungsprobleme I-II. Berichte Nr. 69 und 84 des Rechenzentrums Graz, 1972/3.Google Scholar

—: Die Störungsmethode zur Lösung quadratischer Zuordnungsprobleme. Op. Res. Verf.16, 84–108, 1973.Google Scholar

—: Quadratische Bottleneckprobleme. Op. Res. Verf.18, 26–41, 1974.Google Scholar

-: Numerische Erfahrungen mit Summen- und Bottleneckzuordnungsproblemen. Erscheint in: Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen, hrsg. von L. Collatz und H. Werner, Basel 1975.Google Scholar

-: Kombinatorische Optimierung in Halbgruppen. Erscheint in: Optimierungstheorie und optimale Steuerungen, hrsg. von R. Bulirsch, W. Oettli und J. Stoer, Berlin-Heidelberg-New York 1975.Google Scholar

Burkard, R. E., undA. Gerstl: Quadratische Zuordnungsprobleme III: Testbeispiele und Rechenergebnisse. Bericht Nr. 85 des Rechenzentrums Graz, August 1973.Google Scholar

Burkard, R. E., W. Hahn undU. Zimmermann: An Algebraic Approach to Assignment Problems. Bericht 74-1 des Math. Instituts, Universität Köln 1974.Google Scholar

Buser, P.: Die Kreismethode zur Bestimmung von Layouts. Industrielle Organisation35, Nr. 1, 31–39, 1966.Google Scholar

Carlson, R. C., undG. L. Nemhauser: Scheduling to Minimize Interaction Costs. Op. Res.14, No. 1, 52–58, 1966.Google Scholar

Conrad, K.: Das quadratische Zuweisungsproblem und zwei seiner Spezialfälle. Tübingen 1971.Google Scholar

Conway, R. W., undW. L. Maxwell: A Note on the Assignment of Facility Location. J. Ind. Eng.12, 34–36, 1961.Google Scholar

Freeman, R. J., D. C. Gogerty, G. W. Graves undR. B. S. Brooks: A Mathematical Model of Supply Support for Space Operations. Op. Res.14, No. 1, 1–15, 1966.Google Scholar

Garside, R. G., andT. A. Nicholson: Permutation Procedure for the Backboard Wiring Problem. Proc. IEE.115, 27–30, 1968.Google Scholar

Gaschütz, G. K., undJ. H. Ahrens: Suboptimal Algorithms for the Quadratic Assignment Problem. Naval Res. Log. Quart.15, No. 1, 49–62, 1968.Google Scholar

Gavett, J. W., undN. V. Plyter: The Optimal Assignment of Facilities to Locations by Branch and Bound. Op. Res.14, No. 2, 210–232, 1966.Google Scholar

Gilmore, P. C.: Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem. J. SIAM10, 305–313, 1962.Google Scholar

Graves, G. W., undA. B. Whinston: An Algorithm for the Quadratic Assignment Problem. Man. Sci.17, No. 7, 453–471, 1970.Google Scholar

Greenberg, H.: A Quadratic Assignment Problem Without Column Constraints. Naval Res. Log. Quart.16, No. 3, 417–421, 1969.Google Scholar

Hall, K. M.: Anr-dimensional Quadratic Placement Algorithm. Man. Sci.17, No. 3, 219–229, 1970.Google Scholar

Hanan, M., undJ. M. Kurtzberg: A Review of the Placement and Quadratic Assignment Problems. SIAM Review14, 324–342, 1972.Google Scholar

-: Placement Techniques. In: Design Automation of Digital Systems: Theory and Techniques, hrsg. von M. Breuer, New York 1972.Google Scholar

Heider, C. H.: AnN-Step, 2-Variable Search Algorithm for the Component Placement Problem. Paper No. 90, Center for Naval Analysis, Arlington (Va.) 1972.Google Scholar

—: A Computationally Simplified Pair-Exchange Algorithm for the Quadratic Assignment Problem. Paper No. 101, Center for Naval Analysis, Arlington (Va.) 1972.Google Scholar

Hillier, F. S.: Quantitative Tools for Plant Layout Analysis. J. Ind. Eng.14, No. 1, 33–44, 1963.Google Scholar

Hillier, F. S., undM. M. Connors: Quadratic Assignment Algorithms and the Location of Indivisible Facilities. Man Sci.13, 42–57, 1966.Google Scholar

Ireson, W. G.: Factory Planning and Plant Layout. Englewood Cliffs, N. J., 1952.Google Scholar

Jaksch, H. J.: Agglomeration Cost and the Quadratic Assignment Problem. Econometrica34, 1966.Google Scholar

Kaufman, L.: The Location of Economic Activities by 0–1 Programming. Thesis, Vrije Universiteit Brussel, Feb. 1975.Google Scholar

Keller, S.: Numerische Grundrißoptimierung. Dissertation, Darmstadt 1969.Google Scholar

Kiehne, R.: Innerbetriebliche Standortplanung und Raumzuordnung. Wiesbaden 1969.Google Scholar

Kodres, U. R.: Geometrical Positioning of Circuit Elements in a Computer. Conference paper 1172, AIEE Fall Meeting, Oct. 1959.Google Scholar

Koopmans, T. C., undM. J. Beckmann: Assignment Problems and the Location of Economic Activities. Econometrica25, 52–76, 1957.Google Scholar

Land, A. H.: A Problem of Assignment with Interrelated Costs. Operational Res. Quart.14, 185–198, 1963.Google Scholar

Lawler, E. L.: The Quadratic Assignment Problem, Man. Sci.9, 586–599, 1963.Google Scholar

-: The Quadratic Assignment Problem: A Brief Survey. Paper presented at the Advanced Study Institute Conf. on Combinatorial Programming, Versailles, Sept. 1974.Google Scholar

Lee, R. C., undJ. M. Moore: Corelap-Computational Relationship Layout Planning. J. Ind. Eng.18, No. 3, 195–200, 1967.Google Scholar

Moore, J. M.: Optimal Locations for Multiple Machines. J. Ind. Eng.12, 307–313, 1961.Google Scholar

-: Plant Layout and Design. New York 1962.Google Scholar

Moucka, J.: Method of design of layouts of single-story buildings. Paper presented at the IVth International Congress of Applied Mathematics in Weimar 1967.Google Scholar

Muther, R. D.: Systematic Plant Layout. New York 1955.Google Scholar

Müller-Merbach, H.: Optimale Reihenfolgen. Berlin-Heidelberg-New York 1970.Google Scholar

-: Heuristische Verfahren. Management Enzyklopädie (Ergänzungsband), München 1973.Google Scholar

-: Modelling techniques and heuristics for combinatorial problems. Paper presented at the Advanced Study Institute Conf. on Combinatorial Programming, Versailles, Sept. 1974.Google Scholar

—: Morphologie heuristischer Lösungsverfahren. Zeitschrift für Operations Research20, H. 1, 1976.Google Scholar

Nugent, C. E., T. E. Vollmann undJ. Ruml: An Experimental Comparison of Techniques for the Assignment of Facilities to Locations. Op. Res.16, 150–173, 1968.Google Scholar

Pack, L., R. Kiehne undH. Reinermann: Raumzuordnung und Raumform. Management International Review5, 7–23, 1966.Google Scholar

Pegels, C. C.: Plant Layout and Discrete Optimizing. Intern. J. of Prod. Research5, 81–92, 1966.Google Scholar

Pierce, J. F., undW. B. Crowston: Tree Search Algorithms for Quadratic Assignment Problems. Naval Res. Log. Quart.18, No. 1, 1–36, 1971.Google Scholar

Pierce, J. F., undD. J. Hatfield: Production Sequencing by Combinatorial Programming. In:J. F. Pierce (Hrsg.): Operations Research and the Design of Management Information Systems. New York 1967.Google Scholar

Raymond, T. C.: A Method for Optimizing Circuit Module Placement. IBM Techn. Disclosure Bull.13, 274–276, 1970.Google Scholar

Roberts, S. M., undB. Flores: Solution of a Combinatorial Problem by Dynamic Programming. Op. Res.13, No. 1, 146–157, 1965.Google Scholar

Rutman, R. A.: An Algorithm for Placement of Interconnected Elements Based on Minimum Wire Length. Proc. AFIPS Spring Joint Computer Conference, 477–491, 1964.Google Scholar

Spielberg, K.: Plant Location with Generalized Search Origin. Man. Sci.16, No. 3, 165–178, 1969.Google Scholar

Steinberg, L.: The Backboard Wiring Problem: A Placement Algorithm. SIAM Review3, 37–50, 1961.Google Scholar

Streim, H.: Heuristische Lösungsverfahren: Versuch einer Begriffsklärung. Zeitschrift für Operations Research19, H. 5, 1975.Google Scholar

Vollman, T. E., undE. S. Buffa: The Facilities Layout Problem in Perspective. Man. Sci.12, 450–468, 1966.Google Scholar

Whitehead, B., undM. Z. Elders: An Approach to the Optimum Layout of Single-Story Buildings. Architects Journal139, 1373–1380, 1964.Google Scholar

Wimmert, R. J.: A Mathematical Model of Equipment Location. J. Ind. Eng.9, 498–505, 1958.Google Scholar