Pages that link to "Item:Q291067"
From MaRDI portal
The following pages link to Robust optimization approach for a chance-constrained binary knapsack problem (Q291067):
Displaying 9 items.
- Robust optimization for non-linear impact of data variation (Q1654345) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty (Q2125227) (← links)
- A robust optimization approach with probe-able uncertainty (Q2239954) (← links)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- Comparative analysis of linear programming relaxations for the robust knapsack problem (Q6170571) (← links)
- A new sequential lifting of robust cover inequalities (Q6492454) (← links)
