{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T02:11:23Z","timestamp":1676772683841},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1975,4,1]],"date-time":"1975-04-01T00:00:00Z","timestamp":165542400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1975,4]]},"DOI":"10.1007\/bf01963926","type":"journal-article","created":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T15:18:44Z","timestamp":1122909524000},"page":"B13-B41","source":"Crossref","is-referenced-by-count":10,"title":["Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte \u2014 Ein \u00dcberblick"],"prefix":"10.1007","volume":"19","author":[{"given":"W.","family":"Domschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01963926_CR1","first-page":"294","volume":"9","author":"G. C. Armour","year":"1963","unstructured":"Armour, G. C., andE. S. Buffa: A heuristic algorithm and simulation approach to relative location of facilities. MS9, 294\u2013309, 1963.","journal-title":"MS"},{"key":"BF01963926_CR2","first-page":"41","volume":"12","author":"A. E. Bindschedler","year":"1961","unstructured":"Bindschedler, A. E., andJ. M. Moore: Optimal location of new machines in existing plant layouts. JE12, 41\u201348, 1961.","journal-title":"JE"},{"key":"BF01963926_CR3","doi-asserted-by":"crossref","unstructured":"Bloech, J.: Optimale Industriestandorte, W\u00fcrzburg-Wien 1970.","DOI":"10.1007\/978-3-642-93614-2"},{"key":"BF01963926_CR4","first-page":"136","volume":"42","author":"E. S. Buffa","year":"1964","unstructured":"Buffa, E. S., G. C. Armour, andT. E. Vollmann: Allocating facilities with CRAFT. Harvard Business Review42, 136\u2013156, 1964.","journal-title":"Harvard Business Review"},{"key":"BF01963926_CR5","first-page":"84","volume":"16","author":"R. E. Burkard","year":"1973","unstructured":"Burkard, R. E.: Die St\u00f6rungsmethode zur L\u00f6sung quadratischer Zuordnungsprobleme. Operations Research-Verfahren16, 84\u2013108, 1973.","journal-title":"Operations Research-Verfahren"},{"key":"BF01963926_CR6","unstructured":"Burkard, R. E., undA. Gerstl: Quadratische Zuordnungsprobleme III: Testbeispiele und Rechenzeiten. Bericht Nr. 85 des Rechenzentrums Graz, August 1973."},{"key":"BF01963926_CR7","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1080\/05695557008974743","volume":"2","author":"A. V. Cabot","year":"1970","unstructured":"Cabot, A. V., R. L. Francis, andM. A. Stary: A network flow solution to a rectilinear distance facility location problem. AIIE-Transact.2, 132\u2013141, 1970.","journal-title":"AIIE-Transact."},{"key":"BF01963926_CR8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.20.1.94","volume":"20","author":"L. Cooper","year":"1972","unstructured":"Cooper, L.: The transportation-location problem. OR20, 94\u2013108, 1972.","journal-title":"OR"},{"key":"BF01963926_CR9","first-page":"331","volume":"16","author":"P. S. Davis","year":"1969","unstructured":"Davis, P. S., andT. L. Ray: A branch-bound algorithm for the capacitated facilities location problem. NR16, 331\u2013344, 1969.","journal-title":"NR"},{"key":"BF01963926_CR10","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/trsc.8.2.126","volume":"8","author":"P. M. Dearing","year":"1974","unstructured":"Dearing, P. M., andR. L. Francis: A network flow solution to a multifacility minimax location problem involving rectilinear distances. Transportation Science8, 126\u2013141, 1974.","journal-title":"Transportation Science"},{"key":"BF01963926_CR11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02252916","volume":"11","author":"W. Domschke","year":"1973","unstructured":"Domschke, W.: Two new algorithms for minimal cost flow problems. Computing11, 275\u2013285, 1973.","journal-title":"Computing"},{"key":"BF01963926_CR12","unstructured":"-: Verfahren zur Bestimmung optimaler Betriebs- und Lagerstandorte. In:E. Bahke (Hrsg.): Materialflu\u00dfsysteme, Bd. II. Kapitel 5, Mainz 1975."},{"key":"BF01963926_CR13","unstructured":"-: Graphentheoretische Verfahren und ihre Anwendungen zur L\u00f6sung von Zuordnungs- und Standortproblemen. Erscheint in Meisenheim\/Glan 1976."},{"key":"BF01963926_CR14","unstructured":"Domschke, W., andW. Stahl: A solution method for a rectilinear distance facility location problem. Discussion Paper Nr. 40 des Instituts f\u00fcr Wirtschaftstheorie und OR der Universit\u00e4t Karlsruhe, September 1974."},{"key":"BF01963926_CR15","first-page":"45","volume":"7","author":"J. K. Drysdale","year":"1969","unstructured":"Drysdale, J. K., andP. J. Sandiford: Heuristic warehouse location \u2014 a case history using a new method. Can. Oprl. Res. Soc.-Journal7, 45\u201361, 1969.","journal-title":"Can. Oprl. Res. Soc.-Journal"},{"key":"BF01963926_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"M. A. Efroymson","year":"1966","unstructured":"Efroymson, M. A., andT. L. Ray: A branch-bound algorithm for plant location. OR14, 361\u2013368, 1966.","journal-title":"OR"},{"key":"BF01963926_CR17","unstructured":"Eilon, S., C. D. T. Watson-Gandy, andN. Christofides: Distribution Management: Mathematical modelling and practical analysis. London 1971."},{"key":"BF01963926_CR18","first-page":"670","volume":"12","author":"E. Feldman","year":"1966","unstructured":"Feldman, E., F. A. Lehrer, andT. L. Ray: Warehouse location under continuous economies of scale. MS12, 670\u2013684, 1966.","journal-title":"MS"},{"key":"BF01963926_CR19","first-page":"57","volume":"14","author":"R. L. Francis","year":"1963","unstructured":"Francis, R. L.: A note on the optimum location of new machines in existing plant layouts. JE14, 57\u201359, 1963.","journal-title":"JE"},{"key":"BF01963926_CR20","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.22.2.400","volume":"22","author":"R. L. Francis","year":"1974","unstructured":"Francis, R. L., andJ. M. Goldstein: Location theory: A selective bibliography. OR22, 400\u2013410, 1974.","journal-title":"OR"},{"key":"BF01963926_CR21","unstructured":"Francis, R. L., andJ. A. White: Facility layout and location: An analytical approach. Englewood Cliffs 1974."},{"key":"BF01963926_CR22","first-page":"49","volume":"15","author":"G. K. Gasch\u00fctz","year":"1968","unstructured":"Gasch\u00fctz, G. K., andJ. H. Ahrens: Suboptimal algorithms for the quadratic assignment problem. NR15, 49\u201362, 1968.","journal-title":"NR"},{"key":"BF01963926_CR23","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/opre.14.2.210","volume":"14","author":"J. W. Gavett","year":"1966","unstructured":"Gavett, J. W., andN. V. Plyter: The optimal assignment of facilities to locations by branch and bound. OR14, 210\u2013232, 1966.","journal-title":"OR"},{"key":"BF01963926_CR24","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1287\/trsc.3.4.352","volume":"3","author":"A. J. Goldman","year":"1969","unstructured":"Goldman, A. J.: Optimal locations for centers in a network. Transportation Science3, 352\u2013360, 1969.","journal-title":"Transportation Science"},{"key":"BF01963926_CR25","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S. L. Hakimi","year":"1964","unstructured":"Hakimi, S. L.: Optimum locations of switching centers and the absolute centers and medians of a graph. OR12, 450\u2013459, 1964.","journal-title":"OR"},{"key":"BF01963926_CR26","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"S. L. Hakimi","year":"1965","unstructured":"\u2014: Optimum distribution of switching centers in a communication network and some related graph theoretic problems. OR13, 462\u2013475, 1965.","journal-title":"OR"},{"key":"BF01963926_CR27","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1287\/opre.20.5.967","volume":"20","author":"S. L. Hakimi","year":"1972","unstructured":"Hakimi, S. L., andS. N. Maheshwari: Optimum locations of centers in networks. OR20, 967\u2013973, 1972.","journal-title":"OR"},{"key":"BF01963926_CR28","first-page":"33","volume":"14","author":"F. S. Hillier","year":"1963","unstructured":"Hillier, F. S.: Quantitative tools for plant layout analysis. JE14, 33\u201340, 1963.","journal-title":"JE"},{"key":"BF01963926_CR29","first-page":"42","volume":"13","author":"F. S. Hillier","year":"1966","unstructured":"Hillier, F. S., andM. M. Connors: Quadratic assignment problem algorithms and the location of indivisible facilities. MS13, 42\u201357, 1966.","journal-title":"MS"},{"key":"BF01963926_CR30","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1080\/00207547308929959","volume":"11","author":"T. M. Khalil","year":"1973","unstructured":"Khalil, T. M.: Facilities relative allocation technique (FRAT). Int. J. Prod. Res.11, 183\u2013194, 1973.","journal-title":"Int. J. Prod. Res."},{"key":"BF01963926_CR31","first-page":"B 718","volume":"18","author":"B. M. Khumawala","year":"1972","unstructured":"Khumawala, B. M.: An efficient branch and bound algorithm for the warehouse location problem. MS18, B 718-B 731, 1972.","journal-title":"MS"},{"key":"BF01963926_CR32","doi-asserted-by":"crossref","unstructured":"Kiehne, R.: Innerbetriebliche Standortprobleme und Raumzuordnung. Wiesbaden 1969.","DOI":"10.1007\/978-3-663-02590-0"},{"key":"BF01963926_CR33","first-page":"643","volume":"9","author":"A. A. Kuehn","year":"1963","unstructured":"Kuehn, A. A., andM. J. Hamburger: A heuristic program for locating warehouses. MS9, 643\u2013666, 1963.","journal-title":"MS"},{"key":"BF01963926_CR34","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584989","volume":"3","author":"R. E. Kuenne","year":"1972","unstructured":"Kuenne, R. E., andR. M. Soland: Exact and approximate solutions to the multisourceWeber problem. Math. Programming3, 193\u2013209, 1972.","journal-title":"Math. Programming"},{"key":"BF01963926_CR35","unstructured":"Kuhn, H. W.: Locational problems and mathematical programming. Colloquium on Applications of Mathematics to Economics, Budapest 1963, Hrsg.A. Pr\u00e9kopa, 235\u2013242, Budapest 1965."},{"key":"BF01963926_CR36","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/BF01584648","volume":"4","author":"H. W. Kuhn","year":"1973","unstructured":"\u2014: A note onFermat's problem. Math. Programming4, 98\u2013107, 1973.","journal-title":"Math. Programming"},{"key":"BF01963926_CR37","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1111\/j.1467-9787.1962.tb00902.x","volume":"4","author":"H. W. Kuhn","year":"1962","unstructured":"Kuhn, H. W., andR. E. Kuenne: An efficient algorithm for the numerical solution of the generalizedWeber problem in spatial economics. Journal of Regional Science4, 21\u201333, 1962.","journal-title":"Journal of Regional Science"},{"key":"BF01963926_CR38","first-page":"195","volume":"18","author":"R. C. Lee","year":"1967","unstructured":"Lee, R. C., andJ. M. Moore:Corelap-computerized relationship layout planning. JE18, 195\u2013200, 1967.","journal-title":"JE"},{"key":"BF01963926_CR39","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1057\/jors.1967.73","volume":"18","author":"J. Levy","year":"1967","unstructured":"Levy, J.: An extended theorem for location on a network. Oprl. Res. Quartl.18, 433\u2013442, 1967.","journal-title":"Oprl. Res. Quartl."},{"key":"BF01963926_CR40","first-page":"503","volume":"23","author":"R. F. Love","year":"1969","unstructured":"Love, R. F.: Locating facilities in three-dimensional space by convex programming. NR23, 503\u2013516, 1969.","journal-title":"NR"},{"key":"BF01963926_CR41","first-page":"22","volume":"21","author":"R. F. Love","year":"1974","unstructured":"\u2014: The dual of a hyperbolic approximation to the generalized constrained multi-facility location problem withl p distances. MS21, 22\u201333, 1974.","journal-title":"MS"},{"key":"BF01963926_CR42","doi-asserted-by":"crossref","unstructured":"Love, R. F., andS. A. Kraemer: A dual decomposition method for minimizing transportation costs in multi-facility location problems. Transportation Science7, No. 4, 1973.","DOI":"10.1287\/trsc.7.4.297"},{"key":"BF01963926_CR43","doi-asserted-by":"crossref","unstructured":"Love, R. F., andJ. G. Morris: Solving constrained multifacility location problems involvinglp distances using convex programming. Erscheint in OR23, 1975.","DOI":"10.1287\/opre.23.3.581"},{"key":"BF01963926_CR44","doi-asserted-by":"crossref","unstructured":"L\u00fcder, K.: Standortwahl; Verfahren zur Planung betrieblicher und innerbetrieblicher Standorte. In:H. Jacob (Hrsg.): Industriebetriebslehre in programmierter Form. Bd. I: Grundlagen. S. 41 bis 115, Wiesbaden 1972.","DOI":"10.1007\/978-3-663-13292-9_2"},{"key":"BF01963926_CR45","first-page":"213","volume":"11","author":"A. S. Manne","year":"1964","unstructured":"Manne, A. S.: Plant location under economies-of-scale \u2014 decentralization and computation. MS11, 213\u2013235, 1964.","journal-title":"MS"},{"key":"BF01963926_CR46","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1057\/jors.1964.47","volume":"15","author":"F. E. Maranzana","year":"1964","unstructured":"Maranzana, F. E.: On the location of supply points to minimize transport costs. Oprl. Res. Quartl.15, 261\u2013270, 1964.","journal-title":"Oprl. Res. Quartl."},{"key":"BF01963926_CR47","unstructured":"Marks, D. H., andJ. C. Liebman: Mathematical analysis of solid waste collection. Research Grant EC-00309, Johns Hopkins University 1970."},{"key":"BF01963926_CR48","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/opre.6.2.232","volume":"6","author":"W. Miehle","year":"1958","unstructured":"Miehle, W.: Link-length minimization in networks. OR6, 232\u2013243, 1958.","journal-title":"OR"},{"key":"BF01963926_CR49","first-page":"307","volume":"12","author":"J. M. Moore","year":"1961","unstructured":"Moore, J. M.: Optimal locations for multiple machines. JE12, 307\u2013313, 1961.","journal-title":"JE"},{"key":"BF01963926_CR50","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1080\/00207547408919538","volume":"12","author":"J. M. Moore","year":"1974","unstructured":"\u2014: Computer aided facilities design: An international survey. Int. J. Prod. Res.12, 21\u201344, 1974.","journal-title":"Int. J. Prod. Res."},{"key":"BF01963926_CR51","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1057\/jors.1973.75","volume":"24","author":"J. G. Morris","year":"1973","unstructured":"Morris, J. G.: A linear programming approach to the solution of constrained multi-facility minimax location problems where distances are rectangular. Oprl. Res. Quartl.24, 419\u2013435, 1973.","journal-title":"Oprl. Res. Quartl."},{"key":"BF01963926_CR52","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"16","author":"C. E. Nugent","year":"1968","unstructured":"Nugent, C. E., T. E. Vollmann, andJ. Ruml: An experimental comparison of techniques for the assignment of facilities to locations. OR16, 150\u2013173, 1968.","journal-title":"OR"},{"key":"BF01963926_CR53","first-page":"1","volume":"18","author":"J. F. Pierce","year":"1971","unstructured":"Pierce, J. F., andW. B. Crowston: Tree-search algorithms for quadratic assignment problems. NR18, 1\u201336, 1971.","journal-title":"NR"},{"key":"BF01963926_CR54","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1080\/05695557008974767","volume":"2","author":"A. A. B. Pritsker","year":"1970","unstructured":"Pritsker, A. A. B., andP. M. Ghare: Locating new facilities with respect to existing facilities. AIIE-Transact.2, 290\u2013297, 1970.","journal-title":"AIIE-Transact."},{"key":"BF01963926_CR55","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/05695557308974910","volume":"5","author":"M. R. Rao","year":"1973","unstructured":"Rao, M. R.: On the direct search approach to the rectilinear facilities location problem. AIIE-Transact.5, 256\u2013264, 1973.","journal-title":"AIIE-Transact."},{"key":"BF01963926_CR56","volume-title":"Applications of mathematical programming techniques","author":"P. Rech","year":"1971","unstructured":"Rech, P., andL. G. Barton: A non-convex transportation algorithm. In:E. Beale (Ed.): Applications of mathematical programming techniques. English Universities Press, London 1971."},{"key":"BF01963926_CR57","doi-asserted-by":"crossref","first-page":"108","DOI":"10.2307\/2525301","volume":"3","author":"S. Reiter","year":"1962","unstructured":"Reiter, S., andG. R. Sherman: Allocating indivisible resources affording external economies or diseconomies. Int. Econ. Rev.3, 108\u2013135, 1962.","journal-title":"Int. Econ. Rev."},{"key":"BF01963926_CR58","first-page":"692","volume":"16","author":"C. ReVelle","year":"1970","unstructured":"ReVelle, C., D. Marks, andJ. C. Liebman: An analysis of private and public sector location models. MS16, 692\u2013707, 1970.","journal-title":"MS"},{"key":"BF01963926_CR59","first-page":"690","volume":"18","author":"J. M. Seehof","year":"1967","unstructured":"Seehof, J. M., andW. O. Evans: Automated layout design program. JE18, 690\u2013695, 1967.","journal-title":"JE"},{"key":"BF01963926_CR60","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/opre.17.1.85","volume":"17","author":"K. Spielberg","year":"1969","unstructured":"Spielberg, K.: Algorithms for the simple plant-location problem with some side conditions. OR17, 85\u2013111, 1969.","journal-title":"OR"},{"key":"BF01963926_CR61","series-title":"Bibliography Series","volume-title":"Industrial location: A review and annotated bibliography of theoretical, empirical, and case studies","author":"B. H. Stevens","year":"1967","unstructured":"Stevens, B. H., andC. A. Brackett: Industrial location: A review and annotated bibliography of theoretical, empirical, and case studies. Bibliography Series No. 3, Regional Science Research Institute, Philadelphia 1967."},{"key":"BF01963926_CR62","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"M. B. Teitz","year":"1968","unstructured":"Teitz, M. B., andP. Bart: Heuristic methods for estimating the generalized vertex median of a weighted graph. OR16, 955\u2013961, 1968.","journal-title":"OR"},{"key":"BF01963926_CR63","first-page":"B 240","volume":"13","author":"R. C. Vergin","year":"1967","unstructured":"Vergin, R. C., andJ. D. Rogers: An algorithm and computational procedure for locating economic facilities. MS13, B 240-B 254, 1967.","journal-title":"MS"},{"key":"BF01963926_CR64","first-page":"321","volume":"19","author":"T. E. Vollmann","year":"1968","unstructured":"Vollmann, T. E., C. E. Nugent, andR. L. Zartler: A computerized model for office layout. JE19, 321\u2013327, 1968.","journal-title":"JE"},{"key":"BF01963926_CR65","unstructured":"Weber, A.: \u00dcber den Standort der Industrien. 1. Teil: Reine Theorie des Standortes. T\u00fcbingen 1909."},{"key":"BF01963926_CR66","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1287\/opre.19.1.124","volume":"19","author":"G. O. Wesolowsky","year":"1971","unstructured":"Wesolowsky, G. O., andR. F. Love: The optimal location of new facilities using rectangular distances. OR19, 124\u2013130, 1971.","journal-title":"OR"},{"key":"BF01963926_CR67","unstructured":"Witten, P.: Distributionsmodelle. Planungsans\u00e4tze und L\u00f6sungsverfahren f\u00fcr Transport- und Lagerprobleme. G\u00f6ttingen 1974."}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01963926.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01963926\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01963926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T14:25:29Z","timestamp":1586355929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01963926"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,4]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1975,4]]}},"alternative-id":["BF01963926"],"URL":"https:\/\/doi.org\/10.1007\/bf01963926","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,4]]}}}