Dynamic versions of set covering type public facility location problems
DOI10.1016/0377-2217(82)90159-XzbMATH Open0491.90038OpenAlexW2083009017MaRDI QIDQ1167656FDOQ1167656
Authors: Gamini Gunawardane 
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
logisticscomputational experiencedynamic 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)
Cites Work
- An Analysis of Private and Public Sector Location Models
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- Identification of special structure constraints in linear programs
- Title not available (Why is that?)
Cited In (14)
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- Multi-period stochastic covering location problems: modeling framework and solution approach
- Forecast horizons and dynamic facility location planning
- Algorithms for large scale set covering problems
- The leader-follower location model
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Single facility location and relocation problem with time dependent weights and discrete planning horizon
- The use of state space relaxation for the dynamic facility location problem
- Location analysis: a synthesis and survey
- Strategic facility location: A review
- A taxonomy for emergency service station location problem
- Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
- Chance-constrained set covering with Wasserstein ambiguity
- Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem
Uses Software
This page was built for publication: Dynamic versions of set covering type public facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1167656)
