Pages that link to "Item:Q1410308"

The following pages link to BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308):

Displaying 49 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 cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization (Q339591) (← links)
• On air traffic flow management with rerouting. I: Deterministic case (Q439636) (← links)
• On air traffic flow management with rerouting. II: Stochastic case (Q439637) (← links)
• A heuristic block coordinate descent approach for controlled tabular adjustment (Q547141) (← links)
• A computational comparison of several formulations for the multi-period incremental service facility location problem (Q610997) (← links)
• Forestry management under uncertainty (Q666469) (← links)
• Stochastic set packing problem (Q713096) (← 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)
• A heuristic procedure for stochastic integer programs with complete recourse (Q819082) (← links)
• On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty (Q839843) (← 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)
• A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems (Q1010269) (← links)
• On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty (Q1026569) (← links)
• On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming (Q1040974) (← 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)
• Risk management for forestry planning under uncertainty in demand and prices (Q1754283) (← links)
• A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty (Q1761157) (← links)
• Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
• Convex approximations for a class of mixed-integer recourse models (Q1958624) (← links)
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation (Q2129194) (← links)
• A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (Q2274882) (← links)
• A fuzzy model for shortage planning under uncertainty due to lack of homogeneity in planned production lots (Q2282913) (← links)
• PySP: modeling and solving stochastic programs in Python (Q2392659) (← links)
• Stochastic dual dynamic integer programming (Q2414913) (← links)
• A scenario decomposition algorithm for 0-1 stochastic programs (Q2450729) (← links)
• A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes (Q2480254) (← links)
• On deviation measures in stochastic integer programming (Q2488193) (← links)
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach (Q2502202) (← links)
• The value of the stochastic solution in multistage problems (Q2644427) (← links)
• An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects (Q2654324) (← links)
• Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning (Q2974324) (← links)
• Risk Aversion in Two-Stage Stochastic Integer Programming (Q3001274) (← links)
• <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590) (← links)
• Designing e‐commerce supply chains: a stochastic facility–location approach (Q6070977) (← links)
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)
• Stochastic forestry planning under market and growth uncertainty (Q6164380) (← links)