Pages that link to "Item:Q1039776"

The following pages link to A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776):

Displaying 10 items.

• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← 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 binary knapsack problem with qualitative levels (Q2029032) (← 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)
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
• Optimal scenario reduction for one- and two-stage robust optimization with discrete uncertainty in the objective (Q6113355) (← links)
• Polynomial-time combinatorial algorithm for general max-min fair allocation (Q6182677) (← links)