Pages that link to "Item:Q2300641"
From MaRDI portal
The following pages link to Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641):
Displaying 3 items.
- Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees (Q6068703) (← 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)
