Pages that link to "Item:Q1011207"

The following pages link to An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207):

Displaying 12 items.

• An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
• Generalized average shadow prices and bottlenecks (Q1616793) (← links)
• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem (Q1644042) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
• Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873) (← links)
• Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244) (← links)
• An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem (Q5148190) (← links)
• The knapsack problem with forfeit sets (Q6109304) (← links)
• A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)