Pages that link to "Item:Q800227"

The following pages link to A fast algorithm for the linear multiple-choice knapsack problem (Q800227):

Displaying 17 items.

• A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
• A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766) (← links)
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
• A dynamic programming approach to solving the multiple choice knapsack problem (Q761349) (← links)
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem (Q1577777) (← links)
• Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
• The linear multiple choice knapsack problem (Q1825130) (← links)
• A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
• A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
• An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
• (Q3329226) (← links)
• Linear Time Algorithms for Knapsack Problems with Bounded Weights (Q4939603) (← links)