Pages that link to "Item:Q760766"

The following pages link to A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766):

Displaying 26 items.

• An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
• A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
• An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
• Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems (Q733985) (← links)
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
• A fast algorithm for the linear multiple-choice knapsack problem (Q800227) (← links)
• An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
• Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• The bottleneck generalized assignment problem (Q1388853) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• The linear multiple choice knapsack problem (Q1825130) (← links)
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
• Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244) (← links)
• An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
• A solution method for a knapsack problem and its variant (Q3028724) (← links)
• An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
• (Q3329226) (← links)
• The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem (Q3354470) (← links)
• The knapsack problem with disjoint multiple-choice constraints (Q3993988) (← links)
• (Q4387182) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
• Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)