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.
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix (Q1958623) (← 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)
- Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches (Q2044575) (← links)
- Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system (Q2046320) (← links)
- Energy and reserve dispatch with distributionally robust joint chance constraints (Q2060530) (← links)
- A derivative-free trust-region algorithm with copula-based models for probability maximization problems (Q2076911) (← links)
- Data-driven tuning for chance constrained optimization: analysis and extensions (Q2085821) (← links)
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← 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)
- Optimized Bonferroni approximations of distributionally robust joint chance constraints (Q2118072) (← links)
- Problem-based optimal scenario generation and reduction in stochastic programming (Q2118075) (← links)
- Risk and complexity in scenario optimization (Q2118077) (← links)
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs (Q2158841) (← links)
- Copula theory approach to stochastic geometric programming (Q2231327) (← links)
- Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parameters (Q2261687) (← links)
- On the chance-constrained minimum spanning \(k\)-core problem (Q2274857) (← links)
- General properties of two-stage stochastic programming problems with probabilistic criteria (Q2290416) (← links)
- Partial sample average approximation method for chance constrained problems (Q2311101) (← links)
- Approximating two-stage chance-constrained programs with classical probability bounds (Q2329660) (← 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)
- On mixing sets arising in chance-constrained programming (Q2429465) (← links)
- Alternate risk measures for emergency medical service system design (Q2430620) (← links)
- A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints (Q2450736) (← links)
- Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
- Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
- Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings (Q2670574) (← links)
- Derivatives of probability functions: unions of polyhedra and elliptical distributions (Q2670977) (← links)
- Single commodity stochastic network design under probabilistic constraint with discrete random variables (Q2797468) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
- Risk-averse shortest path interdiction (Q2830955) (← links)
- An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems (Q2846489) (← links)
- Advances and applications of chance-constrained approaches to systems optimisation under uncertainty (Q2872537) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks (Q2940074) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment (Q2957470) (← links)
- Stochastic programming problems with generalized integrated chance constraints (Q3165906) (← links)
- On the Quantile Cut Closure of Chance-Constrained Problems (Q3186519) (← links)
- Scenario Min-Max Optimization and the Risk of Empirical Costs (Q3449574) (← links)
- ON INTEGRATED CHANCE CONSTRAINTS IN ALM FOR PENSION FUNDS (Q4562945) (← links)
- Probabilistic Partial Set Covering with an Oracle for Chance Constraints (Q4629339) (← links)
- A goal programming approach for solving the random interval linear programming problem (Q4633322) (← links)
