Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
From MaRDI portal
Publication:4599310
DOI10.1287/ijoc.2016.0738zbMath1386.90073OpenAlexW2612103136MaRDI QIDQ4599310
Bernard Gendron, Jean-François Cordeau, Sanjay Dominik Jena
Publication date: 29 December 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6ce235caa19d00dc0f7a06290d8dd2afdcaa8644
Mixed integer programming (90C11) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Dynamic location of modular manufacturing facilities with relocation of individual modules ⋮ 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 Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties ⋮ Heuristics for the dynamic facility location problem with modular capacities
Cites Work
- Unnamed Item
- Unnamed Item
- Solving a dynamic facility location problem with partial closing and reopening
- 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
- About Lagrangian methods in integer optimization
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- Facility location and supply chain management. A review
- Coordinated supply chain management
- A Lagrangean heuristic for the facility location problem with staircase costs
- The capacitated plant location problem
- A Lagrangean heuristic for a modular capacitated location problem
- A multiperiod two-echelon multicommodity capacitated plant location problem
- Lagrangean heuristics for location problems
- Ambulance location and relocation models.
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A bibliography for some fundamental problem categories in discrete location science
- Dynamic supply chain design with inventory
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design
- Bounds for the single source modular capacitated plant location problem
- Capacitated facility location problem with general setup cost
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- 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 Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
- Lagrangean heuristics applied to a variety of large capacitated plant location problems
- Locational analysis: highlights of growth to maturity
- Valid Linear Inequalities for Fixed Charge Problems
- Operations Research and Capacity Expansion Problems: A Survey
- A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Validation of subgradient optimization
- Capacitated dynamic location problems with opening, closure and reopening of facilities
- 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.
