Dynamic versions of set covering type public facility location problems
From MaRDI portal
Publication:1167656
DOI10.1016/0377-2217(82)90159-XzbMath0491.90038OpenAlexW2083009017MaRDI QIDQ1167656
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(82)90159-x
computational experiencelogisticsdynamic versionsmulti- period service coveragemulti-period public facility planning decisionpublic facility location
Numerical mathematical programming methods (65K05) Management decision making, including multiple objectives (90B50) Inventory, storage, reservoirs (90B05)
Related Items
A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem ⋮ The leader-follower location model ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ The use of state space relaxation for the dynamic facility location problem ⋮ Multi-period stochastic covering location problems: modeling framework and solution approach ⋮ Forecast horizons and dynamic facility location planning ⋮ A taxonomy for emergency service station location problem ⋮ Location analysis: a synthesis and survey ⋮ Strategic facility location: A review ⋮ Single facility location and relocation problem with time dependent weights and discrete planning horizon ⋮ Algorithms for large scale set covering problems ⋮ Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
Uses Software
Cites Work
