Pages that link to "Item:Q5427775"
From MaRDI portal
The following pages link to Capacitated dynamic location problems with opening, closure and reopening of facilities (Q5427775):
Displaying 14 items.
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
- Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
- Modeling and solving a logging camp location problem (Q748565) (← links)
- Efficient primal-dual heuristic for a dynamic location problem (Q858286) (← links)
- A dynamic location problem with maximum decreasing capacities (Q953304) (← links)
- A memetic algorithm for multi-objective dynamic location problems (Q960114) (← links)
- Capacity management in public service facility networks: a model, computational tests and a case study (Q2629906) (← links)
- Dynamic-demand capacitated facility location problems with and without relocation (Q3005806) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
- Two-Stage Flow Distribution Model Based on Multi-objective Optimization (Q4977799) (← links)
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
- Notation and classification for logistic network design models (Q5247682) (← links)
- Multi-period facility location and capacity expansion with modular capacities and convex short-term costs (Q6551083) (← links)
