Pages that link to "Item:Q2986896"
From MaRDI portal
The following pages link to Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (Q2986896):
Displaying 7 items.
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Online knapsack of unknown capacity. How to optimize energy consumption in smartphones (Q2405900) (← links)
- Robust Randomized Matchings (Q5219560) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
