Pages that link to "Item:Q4888190"
From MaRDI portal
The following pages link to On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications (Q4888190):
Displayed 17 items.
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- Robust optimization for performance tuning of modern database systems (Q817531) (← links)
- Combinatorial optimization problems in wireless switch design (Q926564) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- Choosing robust solutions in discrete optimization problems with fuzzy costs (Q1037888) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- Robust economic order quantity models (Q1278127) (← links)
- On the robust shortest path problem. (Q1406645) (← links)
- An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
- A randomized algorithm for the min-Max selecting items problem with uncertain weights (Q2267304) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- The lexicographic α-robust knapsack problem (Q3087844) (← links)
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)