Pages that link to "Item:Q3629512"

The following pages link to A Sample Approximation Approach for Optimization with Probabilistic Constraints (Q3629512):

Displaying 50 items.

• Mean-value at risk portfolio efficiency: approaches based on data envelopment analysis models with negative data and their empirical behaviour (Q262452) (← links)
• Dynamic traffic assignment under uncertainty: a distributional robust chance-constrained approach (Q262915) (← links)
• Chance-constrained problems and rare events: an importance sampling approach (Q291054) (← links)
• Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
• Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
• Data-driven chance constrained stochastic program (Q304243) (← links)
• Nonlinear chance constrained problems: optimality conditions, regularization and solvers (Q306384) (← links)
• A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations (Q309061) (← links)
• Using integer programming for balancing return and risk in problems with individual chance constraints (Q342012) (← links)
• A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds (Q342441) (← links)
• Scenario approximation of robust and chance-constrained programs (Q368719) (← links)
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
• An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
• Capital rationing problems under uncertainty and risk (Q429488) (← links)
• Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
• Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints (Q439920) (← links)
• Threshold Boolean form for joint probabilistic constraints with random technology matrix (Q463738) (← links)
• A smoothing function approach to joint chance-constrained programs (Q467479) (← links)
• A characterization of the subdifferential of singular Gaussian distribution functions (Q494871) (← links)
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
• Robust optimization approximation for joint chance constrained optimization problem (Q522276) (← links)
• A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
• Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
• Wait-and-judge scenario optimization (Q681495) (← links)
• Optimality functions in stochastic programming (Q715095) (← links)
• Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem (Q727378) (← links)
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
• Rectangular chance constrained geometric optimization (Q779767) (← links)
• A sparse chance constrained portfolio selection model with multiple constraints (Q785634) (← links)
• Solving joint chance constrained problems using regularization and Benders' decomposition (Q827143) (← links)
• Measuring and optimizing system reliability: a stochastic programming approach (Q828737) (← links)
• A biobjective chance constrained optimization model to evaluate the economic and environmental impacts of biopower supply chains (Q828845) (← links)
• A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
• An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
• Confidence-based reasoning in stochastic constraint programming (Q896433) (← links)
• IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
• Sample average approximation method for chance constrained programming: Theory and applications (Q1035926) (← links)
• Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
• A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand (Q1639278) (← links)
• Chance-constrained economic dispatch with renewable energy and storage (Q1639716) (← links)
• On the convergence of sample approximations for stochastic programming problems with probabilistic criteria (Q1642031) (← links)
• Expected improvement based infill sampling for global robust optimization of constrained problems (Q1642975) (← links)
• Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
• Vehicle routing with probabilistic capacity constraints (Q1651706) (← links)
• Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• (Sub-)differentiability of probability functions with elliptical distributions (Q1711093) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• Cell-and-bound algorithm for chance constrained programs with discrete distributions (Q1753452) (← links)
• Flow-based formulations for operational fixed interval scheduling problems with random delays (Q1789616) (← links)