Pages that link to "Item:Q2429465"
From MaRDI portal
The following pages link to On mixing sets arising in chance-constrained programming (Q2429465):
Displaying 50 items.
- Constrained optimization with stochastic feasibility regions applied to vehicle path planning (Q280102) (← links)
- 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)
- Data-driven chance constrained stochastic program (Q304243) (← links)
- Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization (Q322926) (← links)
- Using integer programming for balancing return and risk in problems with individual chance constraints (Q342012) (← links)
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← 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)
- 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)
- 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)
- (Sub-)differentiability of probability functions with elliptical distributions (Q1711093) (← links)
- Cell-and-bound algorithm for chance constrained programs with discrete distributions (Q1753452) (← links)
- On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
- Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection (Q1935293) (← links)
- An adaptive model with joint chance constraints for a hybrid wind-conventional generator system (Q1989737) (← links)
- Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems (Q2010090) (← links)
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
- Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity (Q2097654) (← links)
- Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets (Q2115132) (← links)
- Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty (Q2140173) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
- A linear programming approach for linear programs with probabilistic constraints (Q2356018) (← links)
- On intersection of two mixing sets with applications to joint chance-constrained programs (Q2414899) (← links)
- An algorithm for binary linear chance-constrained problems using IIS (Q2419523) (← links)
- Derivatives of probability functions: unions of polyhedra and elliptical distributions (Q2670977) (← links)
- Chance-constrained set covering with Wasserstein ambiguity (Q2687060) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities (Q2830767) (← links)
- Risk-Averse Shortest Path Interdiction (Q2830955) (← links)
- AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS (Q2846489) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- On the Quantile Cut Closure of Chance-Constrained Problems (Q3186519) (← links)
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs (Q4609472) (← links)
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
- A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints (Q4637499) (← links)
- Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information (Q4687246) (← links)
- Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs (Q4995100) (← links)
- On the Convexity of Level-sets of Probability Functions (Q5074513) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data (Q5139613) (← links)
