The Facility Location Problem with Limited Distances
From MaRDI portal
Publication:3988705
DOI10.1287/trsc.25.3.183zbMath0744.90046OpenAlexW2155850117MaRDI QIDQ3988705
George O. Wesolowsky, Zvi Drezner, Avram Mehrez
Publication date: 28 June 1992
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.25.3.183
Mixed integer programming (90C11) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (15)
A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ A d.c. optimization method for single facility location problems ⋮ New heuristic algorithms for solving the planar \(p\)-median problem ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Location Problems with Cutoff ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ Solving a continuous local access network design problem with a stabilized central column generation approach ⋮ On the Weber facility location problem with limited distances and side constraints ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ A stochastic gradual cover location problem ⋮ New local searches for solving the multi-source Weber problem ⋮ Maximizing the minimum cover probability by emergency facilities ⋮ Generalized coverage: new developments in covering location models ⋮ The continuous knapsack problem with capacities ⋮ Stabilized column generation
This page was built for publication: The Facility Location Problem with Limited Distances
