The impact of distance on location problems
From MaRDI portal
Publication:1142684
DOI10.1016/0377-2217(80)90110-1zbMath0439.90024OpenAlexW2035849205MaRDI QIDQ1142684
Peter Mark Pruzan, Jakob Krarup
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90110-1
Inventory, storage, reservoirs (90B05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items
Location problems with costs being sums of powers of Euclidean distances, Algorithms for location problems based on angular distances, Demand sensitivity to space-price competition with Manhattan and Euclidean representations of distance, On the feasible set for the squared Euclidean Weber problem and applications, Some personal views on the current state and the future of locational analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reducibility of minimax to minisum 0-1 programming problems
- Selected Families of Location Problems
- Mathematical Models of Road Travel Distances
- A dual algorithm for the constrained shortest path problem
- An algorithm for the solution of a location problem with metric constraints
- Solutions of Constrained Location Problems
- Deterministic network optimization: A bibliography
- A priori error bounds for procurement commodity aggregation in logistics planning models
- A Cut Approach to the Rectilinear Distance Facility Location Problem
- Technical Note—Location Theory: A Selective Bibliography
- Modelling Inter-city Road Distances by Mathematical Functions
- A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
- Exact and approximate solutions to the multisource weber problem
- A note on Fermat's problem
