Pages that link to "Item:Q2462550"
From MaRDI portal
The following pages link to Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550):
Displayed 12 items.
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- The robust knapsack problem with queries (Q337391) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694) (← links)
- An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
- The polynomial robust knapsack problem (Q2103045) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← 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)
- Maximizing the configuration robustness for parallel multi-purpose machines under setup cost constraints (Q2434297) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)