Pages that link to "Item:Q1306366"

The following pages link to Dual decomposition in stochastic integer programming (Q1306366):

Displaying 50 items.

• A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
• Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• An efficient two-stage algorithm for decentralized scheduling of micro-CHP units (Q319702) (← links)
• Optimal design of bilateral contracts for energy procurement (Q319838) (← links)
• A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty (Q322919) (← links)
• Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
• Forward thresholds for operation of pumped-storage stations in the real-time energy market (Q323325) (← links)
• An SDP approach for multiperiod mixed 0-1 linear programming models with stochastic dominance constraints for risk management (Q337504) (← links)
• Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
• Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization (Q339591) (← links)
• Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment (Q342004) (← links)
• Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
• Stochastic multi-site capacity planning of TFT-LCD manufacturing using expected shadow-price based decomposition (Q345460) (← links)
• A two-stage stochastic mixed-integer programming approach to the index tracking problem (Q374678) (← links)
• Stochastic programming approach for energy management in electric microgrids (Q478949) (← links)
• The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
• Water distribution networks design under uncertainty (Q526639) (← links)
• A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse (Q623459) (← links)
• Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
• Stochastic set packing problem (Q713096) (← links)
• Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
• Stochastic optimization models in forest planning: a progressive hedging solution approach (Q748577) (← links)
• B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
• Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
• A heuristic procedure for stochastic integer programs with complete recourse (Q819082) (← 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 a stochastic sequencing and scheduling problem (Q875406) (← links)
• On the enrouting protocol problem under uncertainty (Q877076) (← links)
• Stochastic programming for optimizing bidding strategies of a Nordic hydropower producer (Q877081) (← links)
• A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
• Stochastic 0-1 linear programming under limited distributional information (Q935201) (← links)
• Optimization of R\&D project portfolios under endogenous uncertainty (Q992625) (← links)
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems (Q1010269) (← links)
• The stochastic trim-loss problem (Q1011257) (← links)
• Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
• Supply chain design under uncertainty using sample average approximation and dual decomposition (Q1042158) (← links)
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information (Q1634284) (← links)
• Stochastic programming for qualification management of parallel machines in semiconductor manufacturing (Q1652146) (← links)
• Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization (Q1652363) (← links)
• Two-stage stochastic, large-scale optimization of a decentralized energy system: a case study focusing on solar PV, heat pumps and storage in a residential quarter (Q1703468) (← links)
• BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs (Q1727944) (← links)
• New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation (Q1735183) (← links)