Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
From MaRDI portal
Publication:4070966
DOI10.1007/BF01963926zbMath0311.90017OpenAlexW1971255172MaRDI QIDQ4070966
Publication date: 1975
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01963926
Programming involving graphs or networks (90C35) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Operations research and management science (90Bxx)
Related Items
Layoutplanung - der Stand der Technik ⋮ Computational experiences with the exchange method. Applied to four commonly used partitioning cluster analysis criteria
Cites Work
- Unnamed Item
- Two new algorithms for minimal cost flow problems
- The Dual of a Hyperbolic Approximation to the Generalized Constrained Multi-Facility Location Problem with lp, Distances
- Technical Note—Location Theory: A Selective Bibliography
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- An Extended Theorem for Location on a Network
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- A branch‐bound algorithm for the capacitated facilities location problem
- Locating facilities in three‐dimensional space by convex programming
- An Analysis of Private and Public Sector Location Models
- Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
- Tree-search algorithms for quadratic assignment problems
- The Transportation-Location Problem
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- Exact and approximate solutions to the multisource weber problem
- Optimum Locations of Centers in Networks
- A note on Fermat's problem
- A Linear Programming Approach to the Solution of Constrained Multi-Facility Minimax Location Problems where Distances are Rectangular
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
