Pages that link to "Item:Q2664280"

The following pages link to Lower and upper bounds for the non-linear generalized assignment problem (Q2664280):

Displaying 2 items.

• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)