Pages that link to "Item:Q688927"

The following pages link to The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927):

Displaying 50 items.

• Stochastic single-allocation hub location (Q2029287) (← links)
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
• Benders' decomposition for the balancing of assembly lines with stochastic demand (Q2030547) (← links)
• A robust optimization approach for the multi-mode resource-constrained project scheduling problem (Q2030698) (← links)
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
• Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector (Q2084032) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• Stochastic Lipschitz dynamic programming (Q2118094) (← links)
• Exact solutions to a carsharing pricing and relocation problem under uncertainty (Q2147083) (← links)
• A matheuristic approach for optimizing mineral value chains under uncertainty (Q2147943) (← links)
• An extended formulation for two-stage stochastic unit commitment with reserves (Q2157884) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
• An exact method for constrained maximization of the conditional value-at-risk of a class of stochastic submodular functions (Q2183220) (← links)
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands (Q2183324) (← links)
• Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk (Q2189450) (← links)
• Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
• A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models (Q2235163) (← links)
• A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
• Distribution network deployment for omnichannel retailing (Q2240051) (← links)
• A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) (← 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)
• Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables (Q2284466) (← links)
• Optimizing maintenance service contracts through mechanism design theory (Q2293743) (← links)
• Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem (Q2300645) (← links)
• Liner ship bunkering and sailing speed planning with uncertain demand (Q2301031) (← links)
• On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
• The stochastic opportunistic replacement problem. II: A two-stage solution approach (Q2341273) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• Decision tree analysis for a risk averse decision maker: CVaR criterion (Q2356215) (← links)
• Two-stage stochastic hierarchical multiple risk problems: Models and algorithms (Q2390998) (← links)
• A recourse goal programming approach for airport bus routing problem (Q2404354) (← links)
• Stochastic dual dynamic integer programming (Q2414913) (← links)
• A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
• A decomposition approach to the two-stage stochastic unit commitment problem (Q2442096) (← links)
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
• A labeling method for dynamic driver-task assignment with uncertain task durations (Q2488239) (← links)
• Total allowable catch for managing squat lobster fishery using stochastic nonlinear programming (Q2489277) (← links)
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
• The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
• Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach (Q2502202) (← links)
• Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
• On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables (Q2502216) (← links)
• Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) (← links)
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
• A polyhedral approach to bisubmodular function minimization (Q2661581) (← links)
• Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem (Q2668788) (← links)