Pages that link to "Item:Q2784421"
From MaRDI portal
The following pages link to The Sample Average Approximation Method for Stochastic Discrete Optimization (Q2784421):
Displayed 50 items.
- Stochastic uncapacitated hub location (Q421562) (← links)
- Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation (Q429477) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- Sample average approximation of stochastic dominance constrained programs (Q431031) (← links)
- Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation (Q439343) (← links)
- Feasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problem (Q542438) (← links)
- Climate change and optimal energy technology R\&D policy (Q545123) (← links)
- A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
- Stochastic models for budget optimization in search-based advertising (Q603917) (← links)
- Integrated supply chain planning under uncertainty using an improved stochastic approach (Q636501) (← links)
- On two-stage stochastic knapsack problems (Q643023) (← links)
- A dynamic programming strategy to balance exploration and exploitation in the bandit problem (Q647433) (← links)
- Validation analysis of mirror descent stochastic approximation method (Q715058) (← links)
- The static stochastic knapsack problem with normally distributed item sizes (Q715062) (← links)
- Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
- Sample size selection in optimization methods for machine learning (Q715253) (← links)
- A single-resource allocation problem with Poisson resource requirements (Q732784) (← links)
- When it is worthwhile to work with the stochastic RCPSP? (Q835549) (← links)
- Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming (Q839883) (← links)
- A generic stochastic model for supply-and-return network design (Q850288) (← links)
- Sample average approximation of expected value constrained stochastic programs (Q957332) (← links)
- Robust solution of monotone stochastic linear complementarity problems (Q959962) (← links)
- Variable-number sample-path optimization (Q959964) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- Pre-disaster investment decisions for strengthening a highway network (Q976032) (← links)
- Sales and operations planning in systems with order configuration uncertainty (Q976366) (← links)
- Scheduling elective surgery under uncertainty and downstream capacity constraints (Q976503) (← links)
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← links)
- Optimization of R\&D project portfolios under endogenous uncertainty (Q992625) (← links)
- Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm (Q993710) (← links)
- Stochastic programming approach to optimization under uncertainty (Q995788) (← links)
- Supply chain design under uncertainty using sample average approximation and dual decomposition (Q1042158) (← links)
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
- Solution quality of random search methods for discrete stochastic optimization (Q1780464) (← links)
- The sample average approximation method for empty container repositioning with uncertainties (Q1926912) (← links)
- Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand (Q1926991) (← links)
- Component rationing for available-to-promise scheduling in configure-to-order systems (Q2275600) (← links)
- Some large deviations results for Latin hypercube sampling (Q2276415) (← links)
- A solution method for a two-dispatch delivery problem with stochastic customers (Q2369965) (← links)
- The workload balancing problem at air cargo terminals (Q2432093) (← links)
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes (Q2480254) (← links)
- A stochastic programming approach for supply chain network design under uncertainty (Q2484345) (← links)
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
- Event tree based sampling (Q2496018) (← links)
- Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
- Assessing solution quality in stochastic programs (Q2502212) (← links)
- A general framework on the simulation-based optimization under fixed computing budget (Q2503253) (← links)
- The empirical behavior of sampling methods for stochastic programming (Q2507414) (← links)
- On complexity of multistage stochastic programs (Q2583700) (← links)
- An elective surgery scheduling problem considering patient priority (Q2655960) (← links)