On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
From MaRDI portal
(Redirected from Publication:721958)
Recommendations
- Near-optimal solutions to large-scale facility location problems
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- scientific article; zbMATH DE number 1560330
- A Dual-Based Procedure for Stochastic Facility Location
Cites work
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
- A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
- A computational comparison of several formulations for the multi-period incremental service facility location problem
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- A multiperiod two-echelon multicommodity capacitated plant location problem
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- An application of Lagrangian relaxation to a capacity planning problem under uncertainty
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- An integrated supply chain problem: a nested Lagrangian relaxation approach
- Capacity planning and warehouse location in supply chains with uncertain demands
- Cluster Lagrangean decomposition in multistage stochastic optimization
- Designing e‐commerce supply chains: a stochastic facility–location approach
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
- Introduction to stochastic programming.
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Location science
- Multistage stochastic optimization
- Nonlinear integer programming
- On modelling planning under uncertainty in manufacturing
- On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs
- Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
- Risk aversion in multistage stochastic programming: a modeling and algorithmic perspective
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Sequential location-allocation problems on chains and trees with probabilistic link demands
- Stochastic linear programming. Models, theory, and computation.
- The multi-period incremental service facility location problem
- The traveling-salesman problem and minimum spanning trees: Part II
- The volume algorithm: Producing primal solutions with a subgradient method
- The α-reliable mean-excess regret model for stochastic facility location modeling
- Time consistency of dynamic risk measures
- Time-consistent decisions and temporal decomposition of coherent risk functionals
- Validation of subgradient optimization
Cited in
(6)- A multi-period TSP with stochastic regular and urgent demands
- On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management
- Multi-period single-allocation hub location-routing: models and heuristic solutions
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty
- The multi-period \(p\)-center problem with time-dependent travel times
- On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
This page was built for publication: On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721958)
