Pages that link to "Item:Q5275439"
From MaRDI portal
The following pages link to Packing a Knapsack of Unknown Capacity (Q5275439):
Displaying 6 items.
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Online knapsack problem under concave functions (Q2319907) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows (Q6202753) (← links)
