Pages that link to "Item:Q1825130"

The following pages link to The linear multiple choice knapsack problem (Q1825130):

Displaying 18 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)
• A fast algorithm for the linear multiple-choice knapsack problem (Q800227) (← links)
• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• LP relaxation of the two dimensional knapsack problem with box and GUB constraints (Q1266739) (← 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)
• Relief period optimization under budget constraints (Q1600951) (← links)
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
• An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
• (Q3329226) (← links)
• The knapsack problem with disjoint multiple-choice constraints (Q3993988) (← links)
• Minimum-diameter covering problems (Q4520238) (← links)
• The multiple-choice multi-period knapsack problem (Q4661132) (← links)
• Budgeting with bounded multiple-choice constraints. (Q5928374) (← links)