On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
From MaRDI portal
Publication:721958
DOI10.1007/s10589-018-9995-0zbMath1400.90212OpenAlexW2789806613WikidataQ130150714 ScholiaQ130150714MaRDI QIDQ721958
Celeste Pizarro, María Araceli Garín, Aitziber Unzueta, Laureano Fernando Escudero Bueno
Publication date: 20 July 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-9995-0
(dual) Lagrange multipliers updatinglazy (primal) heuristiclocation-assignmentmulti-period stochastic 0-1 optimizationpartial linear relaxationscenario cluster Lagrangean problem
Integer programming (90C10) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management, The multi-period \(p\)-center problem with time-dependent travel times, Multi-period single-allocation hub location-routing: models and heuristic solutions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs
- Risk aversion in multistage stochastic programming: a modeling and algorithmic perspective
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
- Cluster Lagrangean decomposition in multistage stochastic optimization
- An integrated supply chain problem: a nested Lagrangian relaxation approach
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- A computational comparison of several formulations for the multi-period incremental service facility location problem
- Stochastic linear programming. Models, theory, and computation.
- The multi-period incremental service facility location problem
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- A multiperiod two-echelon multicommodity capacitated plant location problem
- The volume algorithm: Producing primal solutions with a subgradient method
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
- A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- Time consistency of dynamic risk measures
- Nonlinear integer programming
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Time-Consistent Decisions and Temporal Decomposition of Coherent Risk Functionals
- Multistage Stochastic Optimization
- Introduction to Stochastic Programming
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- The α-reliable mean-excess regret model for stochastic facility location modeling
- Sequential location-allocation problems on chains and trees with probabilistic link demands
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- An application of Lagrangian relaxation to a capacity planning problem under uncertainty
- Capacity planning and warehouse location in supply chains with uncertain demands
- Validation of subgradient optimization
- Location Science
- The traveling-salesman problem and minimum spanning trees: Part II
- Designing e‐commerce supply chains: a stochastic facility–location approach
