Dynamic versions of set covering type public facility location problems
From MaRDI portal
Publication:1167656
Cites work
- scientific article; zbMATH DE number 3744912 (Why is no real title available?)
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- An Analysis of Private and Public Sector Location Models
- Identification of special structure constraints in linear programs
Cited in
(14)- A taxonomy for emergency service station location problem
- Chance-constrained set covering with Wasserstein ambiguity
- Single facility location and relocation problem with time dependent weights and discrete planning horizon
- Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
- Algorithms for large scale set covering problems
- The use of state space relaxation for the dynamic facility location problem
- Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem
- Location analysis: a synthesis and survey
- Forecast horizons and dynamic facility location planning
- The leader-follower location model
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- Strategic facility location: A review
- Multi-period stochastic covering location problems: modeling framework and solution approach
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)