Pages that link to "Item:Q342253"
From MaRDI portal
The following pages link to Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253):
Displaying 19 items.
- A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty (Q322919) (← links)
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
- On preparedness resource allocation planning for natural disaster relief under endogenous uncertainty with time-consistent risk-averse management (Q1651646) (← links)
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization (Q1652363) (← links)
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems (Q1751680) (← links)
- On the time-consistent stochastic dominance risk averse measure for tactical supply chain planning under uncertainty (Q1782185) (← links)
- Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design (Q2027067) (← links)
- Applications of stochastic modeling in air traffic management: methods, challenges and opportunities for solving air traffic problems under uncertainty (Q2030538) (← links)
- Some matheuristic algorithms for multistage stochastic optimization models with endogenous uncertainty and risk management (Q2184057) (← links)
- A multi-stage stochastic integer programming approach for locating electric vehicle charging stations (Q2297573) (← links)
- Stochastic dual dynamic integer programming (Q2414913) (← links)
- Lagrange dual bound computation for stochastic service network design (Q2672131) (← links)
- A Lagrangian decomposition scheme for choice-based optimization (Q2676388) (← links)
- Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design (Q5084598) (← links)
- Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs (Q5139855) (← links)
- Comparing stage-scenario with nodal formulation for multistage stochastic problems (Q6057723) (← links)
- Dynamic reverse supply chain network design under uncertainty: mathematical modeling and solution algorithm (Q6060651) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)