Standortwahl: Verfahren zur Planung betrieblicher und innerbetrieblicher Standorte

[1]  K. Spielberg.  Plant Location with Generalized Search Origin , 1969 .

[2]  P. S. Davis,et al.  A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[3]  Harold W. Kulin,et al.  AN EFFICIENT ALGORITHM FOR THE NUMERICAL SOLUTION OF THE GENERALIZED WEBER PROBLEM IN SPATIAL ECONOMICS , 1962 .

[4]  Elwood S. Buffa,et al.  The Facilities Layout Problem in Perspective , 1966 .

[5]  A. Hart.  A Chart for Evaluating Product Research and Development Projects , 1966 .

[6]  Richard M. Soland,et al.  Exact and approximate solutions to the multisource weber problem , 1972, Math. Program..

[7]  K. Eisemann.  The Optimum Location of a Center , 1962 .

[8]  Burton V. Dean,et al.  Scoring and Profitability Models for Evaluating and Selecting Engineering Projects , 1965 .

[9]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[10]  A. Manne.  Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .

[11]  Werner Grundmann.  Mathematische Methoden zur Standortbestimmung , 1968 .

[12]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[13]  Leon Cooper,et al.  Heuristic Methods for Location-Allocation Problems , 1964 .

[14]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[15]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[16]  Heiner Müller-Merbach,et al.  Operations research : Methoden und Modelle der Optimalplanung , 1969 .

[17]  J. W. Gavett,et al.  The Optimal Assignment of Facilities to Locations by Branch and Bound , 1966, Oper. Res..

[18]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[19]  W. Miehle.  Link-Length Minimization in Networks , 1958 .

[20]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[21]  Graciano Sá,et al.  Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem , 1969, Oper. Res..

[22]  E. Lawler.  The Quadratic Assignment Problem , 1963 .

[23]  Leon Cooper,et al.  The Transportation-Location Problem , 1972, Oper. Res..

[24]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[25]  Elwood S. Buffa,et al.  A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities , 1963 .

[26]  William Grant Ireson.  Factory planning and plant layout , 1952 .

[27]  Norman J. Driebeek.  An Algorithm for the Solution of Mixed Integer Programming Problems , 1966 .

[28]  B. M. Khumawala.  An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[29]  Andrew Whinston,et al.  An Algorithm for the Quadratic Assignment Problem , 1970 .

[30]  R. C. Lee,et al.  CORELAP: Computerized relationship layout planning , 1967 .

[31]  R. Kiehne.  Innerbetriebliche Standortplanung und Raumzuordnung , 1969 .