Solving a dynamic facility location problem with partial closing and reopening
From MaRDI portal
(Redirected from Publication:342268)
Recommendations
- Capacitated dynamic location problems with opening, closure and reopening of facilities
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- A dynamic location problem with maximum decreasing capacities
- Dynamic-demand capacitated facility location problems with and without relocation
- Heuristics for the dynamic facility location problem with modular capacities
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Procedure for Dynamic Facility Location
- A Lagrangean heuristic for a modular capacitated location problem
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- About Lagrangian methods in integer optimization
- Ambulance location and relocation models.
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- Capacitated dynamic location problems with opening, closure and reopening of facilities
- Capacitated facility location problem with general setup cost
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Lagrangean heuristics for location problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Modeling and solving a logging camp location problem
- Multi-Dimensional Location Problems
- On solving complex multi-period location models using simulated annealing.
- On the capacitated concentrator location problem: a reformulation by discretization
- Operations Research and Capacity Expansion Problems: A Survey
- Solving the dynamic facility location problem
- Stochastic facility location with general long-run costs and convex short-run costs
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
Cited in
(16)- A dynamic location problem with maximum decreasing capacities
- Mathematical formulations for multi-period network design with modular capacity adjustments
- Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
- Multi-period facility location and capacity expansion with modular capacities and convex short-term costs
- Integrated facility location and capacity planning under uncertainty
- Heuristics for the dynamic facility location problem with modular capacities
- Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway
- Dynamic location of modular manufacturing facilities with relocation of individual modules
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
- A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems
- Dynamic-demand capacitated facility location problems with and without relocation
- The dynamic facility location problem with mobile production units: a waste recycling application
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Capacitated dynamic location problems with opening, closure and reopening of facilities
This page was built for publication: Solving a dynamic facility location problem with partial closing and reopening
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342268)
