Pages that link to "Item:Q1388832"

The following pages link to A minimal algorithm for the multiple-choice knapsack problem (Q1388832):

Displaying 17 items.

• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
• An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
• A DYNAMIC PROGRAMMING HEURISTIC FOR RETAIL SHELF SPACE ALLOCATION PROBLEM (Q2998842) (← links)
• A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code (Q3002339) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• The knapsack problem with a minimum filling constraint (Q3120586) (← links)
• An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
• (Q3329226) (← links)
• Admission control in computer networks with uncertain parameters (Q3451512) (← links)
• An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core (Q3628453) (← links)
• The knapsack problem with disjoint multiple-choice constraints (Q3993988) (← links)
• A Minimal Algorithm for the 0-1 Knapsack Problem (Q4393123) (← links)
• A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^® (Q5059432) (← links)
• A minimal algorithm for the Bounded Knapsack Problem (Q5101408) (← links)
• A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems (Q5171816) (← links)
• Random knapsack in expected polynomial time (Q5917572) (← links)
• Budgeting with bounded multiple-choice constraints. (Q5928374) (← links)