Pages that link to "Item:Q2429465"
From MaRDI portal
The following pages link to On mixing sets arising in chance-constrained programming (Q2429465):
Displayed 13 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)
- 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)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection (Q1935293) (← links)
- A linear programming approach for linear programs with probabilistic constraints (Q2356018) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← 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)