The multi-period incremental service facility location problem
From MaRDI portal
(Redirected from Publication:960382)
Recommendations
- The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
- A computational comparison of several formulations for the multi-period incremental service facility location problem
- An incremental algorithm for the uncapacitated facility location problem
- The incremental connected facility location problem
- MIP modeling of incremental connected facility location
Cites work
- A Dual-Based Procedure for Dynamic Facility Location
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
- A multiperiod two-echelon multicommodity capacitated plant location problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- Dynamic facility location: The progressive p-median problem
- Dynamic supply chain design with inventory
- Forecast horizons and dynamic facility location planning
- Multi-Dimensional Location Problems
- Solving the dynamic facility location problem
Cited in
(28)- Modeling and solving a logging camp location problem
- Ordered \(p\)-median problems with neighbourhoods
- The incremental cooperative design of preventive healthcare networks
- The value of the multi-period solution revisited: when to model time in capacitated location problems
- Modeling and solution of maximal covering problem considering gradual coverage with variable radius over multi-periods
- Evasive flow capture: a multi-period stochastic facility location problem with independent demand
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
- An incremental algorithm for the uncapacitated facility location problem
- Comparing the solvers for the mixed integer linear programming problems and the software environments that call them
- OR models in urban service facility location: a critical review of applications and future developments
- MIP modeling of incremental connected facility location
- The incremental connected facility location problem
- New models for the location of controversial facilities: a bilevel programming approach
- Multi-period capacitated facility location under delayed demand satisfaction
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
- Multi-service facility location models
- Location and reorganization problems: the Calabrian health care system case
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- A computational comparison of several formulations for the multi-period incremental service facility location problem
- Continuous location under the effect of `refraction'
- The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
- Modelling and planning public cultural schedules for efficient use of resources
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
- Simple dynamic location problem with uncertainty: a primal-dual heuristic approach
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- A branch and price algorithm for the pharmacy duty scheduling problem
- Multiperiod location-routing with decoupled time scales
This page was built for publication: The multi-period incremental service facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960382)
