Pages that link to "Item:Q1762093"
From MaRDI portal
The following pages link to An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees (Q1762093):
Displaying 27 items.
- An algorithm for two-stage stochastic mixed-integer nonlinear convex problems (Q256673) (← links)
- Medium range optimization of copper extraction planning under uncertainty in future copper prices (Q297027) (← links)
- A parallelised distributed implementation of a branch and fix coordination algorithm (Q319288) (← links)
- On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs (Q320895) (← links)
- A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty (Q322919) (← links)
- Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty (Q336654) (← links)
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization (Q336664) (← links)
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design (Q336890) (← links)
- An effective heuristic for multistage linear programming with a stochastic right-hand side (Q337144) (← links)
- An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management (Q337504) (← links)
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization (Q339591) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems (Q839891) (← links)
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty (Q889106) (← links)
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems (Q1010269) (← links)
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← 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)
- Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic (Q2288876) (← links)
- An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects (Q2654324) (← links)
- Multistage robust discrete optimization via quantified integer programming (Q2669532) (← links)
- A graph theoretic approach to non-anticipativity constraint generation in multistage stochastic programs with incomplete scenario sets (Q2676284) (← links)
- On using multistage linking constraints for stochastic optimization as a decision-making aid (Q2872756) (← links)
- Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs (Q5139855) (← links)
- On solving strong multistage nonsymmetric stochastic mixed 0-1 problems (Q5176358) (← links)
