Pages that link to "Item:Q1675929"
From MaRDI portal
The following pages link to Randomized strategies for cardinality robustness in the knapsack problem (Q1675929):
Displaying 7 items.
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Robust Randomized Matchings (Q5219560) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Packing a Knapsack of Unknown Capacity (Q5275439) (← links)
- Randomized strategies for robust combinatorial optimization with approximate separation (Q6182680) (← links)
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)