Pages that link to "Item:Q733540"

The following pages link to Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540):

Displaying 11 items.

• Solving constrained optimization problems by solution-based decomposition search (Q326460) (← links)
• A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm (Q363591) (← links)
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
• A trust region method for the solution of the surrogate dual in integer programming (Q896175) (← links)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
• The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
• SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Piece selection algorithms for layered video streaming in P2P networks (Q2440125) (← links)
• A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)