Pages that link to "Item:Q1926647"
From MaRDI portal
The following pages link to Computing knapsack solutions with cardinality robustness (Q1926647):
Displaying 12 items.
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Randomized strategies for cardinality robustness in the knapsack problem (Q1675929) (← links)
- The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
- Fractionally subadditive maximization under an incremental knapsack constraint (Q2085751) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- The lexicographic α-robust knapsack problem (Q3087844) (← links)
- (Q4996546) (← links)
- Robust Randomized Matchings (Q5219560) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← 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)