Pages that link to "Item:Q840573"

The following pages link to Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem (Q840573):

Displaying 6 items.

• A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
• A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)