Pages that link to "Item:Q1304387"

The following pages link to A note on the max-min 0-1 knapsack problem (Q1304387):

Displaying 16 items.

• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
• Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
• A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
• Comment on 'Some computational results on real 0-1 knapsack problems' (Q1089254) (← links)
• A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← 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)
• 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)
• 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)
• A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)
• A Minimal Algorithm for the 0-1 Knapsack Problem (Q4393123) (← links)
• Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)