Pages that link to "Item:Q847852"
From MaRDI portal
The following pages link to An integer programming approach for linear programs with probabilistic constraints (Q847852):
Displaying 50 items.
- On the mixing set with a knapsack constraint (Q291057) (← links)
- Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
- New reformulations for probabilistically constrained quadratic programs (Q296982) (← 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)
- Stochastic nonlinear resource allocation problem (Q325428) (← 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)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- Capital rationing problems under uncertainty and risk (Q429488) (← links)
- Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
- On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem (Q462008) (← 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)
- Uniform quasi-concavity in probabilistic constrained stochastic programming (Q635508) (← links)
- Wait-and-judge scenario optimization (Q681495) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← 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)
- A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation (Q992606) (← links)
- Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)
- Data-driven robust chance constrained problems: a mixture model approach (Q1626548) (← links)
- A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand (Q1639278) (← links)
- Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
- Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design (Q1652658) (← links)
- A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
- A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
- Optimization models of anti-terrorist protection (Q1735316) (← links)
- Convergence conditions for the observed mean method in stochastic programming (Q1745693) (← links)
- Robust decision making using a general utility set (Q1750483) (← links)
- Cell-and-bound algorithm for chance constrained programs with discrete distributions (Q1753452) (← links)
- A second-order cone programming approach for linear programs with joint probabilistic constraints (Q1758269) (← links)
- Flow-based formulations for operational fixed interval scheduling problems with random delays (Q1789616) (← links)
- On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
- A provisioning problem with stochastic payments (Q1926876) (← links)
- Pattern definition of the \(p\)-efficiency concept (Q1931642) (← links)
- Augmented Lagrangian method for probabilistic optimization (Q1931647) (← links)
- Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection (Q1935293) (← links)
- Regularization methods for optimization problems with probabilistic constraints (Q1949268) (← links)
- Analysis of a chance-constrained new product risk model with multiple customer classes (Q1991227) (← links)
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems (Q2010090) (← links)
- Bi-objective autonomous vehicle repositioning problem with travel time uncertainty (Q2026711) (← links)
- Multi-stage stochastic programming models for provisioning cloud computing resources (Q2028773) (← links)
- Multiple kernel learning-aided robust optimization: learning algorithm, computational tractability, and usage in multi-stage decision-making (Q2030473) (← links)
