Pages that link to "Item:Q2247901"
From MaRDI portal
The following pages link to Complexity results and exact algorithms for robust knapsack problems (Q2247901):
Displaying 20 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- Robust combinatorial optimization with knapsack uncertainty (Q1662111) (← links)
- The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
- Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
- A two-stage robust model for a reliable \(p\)-center facility location problem (Q1988633) (← links)
- The polynomial robust knapsack problem (Q2103045) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
- Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity (Q2300641) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199) (← links)
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems (Q2914297) (← links)
- The lexicographic α-robust knapsack problem (Q3087844) (← links)
- (Q4941164) (← links)
- Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty (Q5003707) (← links)
- Optimal Genetic Screening for Cystic Fibrosis (Q5031012) (← links)
- Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)