Solving a dynamic facility location problem with partial closing and reopening
From MaRDI portal
Publication:342268
DOI10.1016/j.cor.2015.10.011zbMath1349.90564OpenAlexW1881614784MaRDI QIDQ342268
Jean-François Cordeau, Sanjay Dominik Jena, Bernard Gendron
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.10.011
Lagrangian relaxationfacility locationmixed-integer programmingdynamic capacity adjustmentindustrial application
Related Items (10)
Dynamic location of modular manufacturing facilities with relocation of individual modules ⋮ 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 ⋮ Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway ⋮ A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems ⋮ Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities ⋮ Integrated facility location and capacity planning under uncertainty ⋮ Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem ⋮ Heuristics for the dynamic facility location problem with modular capacities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Lagrangian heuristic algorithm for a public healthcare facility location problem
- Modeling and solving a logging camp location problem
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- About Lagrangian methods in integer optimization
- A Lagrangean heuristic for a modular capacitated location problem
- Lagrangean heuristics for location problems
- Ambulance location and relocation models.
- Stochastic facility location with general long-run costs and convex short-run costs
- Capacitated facility location problem with general setup cost
- On the capacitated concentrator location problem: a reformulation by discretization
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Operations Research and Capacity Expansion Problems: A Survey
- A Dual-Based Procedure for Dynamic Facility Location
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- The Multiperiod Location-Allocation Problem with Relocation of Facilities
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- Capacitated dynamic location problems with opening, closure and reopening of facilities
- Multi-Dimensional Location Problems
- Solving the dynamic facility location problem
- On solving complex multi-period location models using simulated annealing.
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
This page was built for publication: Solving a dynamic facility location problem with partial closing and reopening
