Pages that link to "Item:Q5585877"

The following pages link to A Branch Search Algorithm for the Knapsack Problem (Q5585877):

Displaying 19 items.

• A branch and search algorithm for a class of nonlinear knapsack problems (Q594771) (← links)
• The zero-one knapsack problem with equality constraint (Q1058453) (← links)
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (Q1108931) (← links)
• Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
• Heuristics and their design: A survey (Q1152854) (← links)
• An algorithm for the solution of the 0-1 knapsack problem (Q1156694) (← links)
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm (Q1245074) (← links)
• An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth (Q1247256) (← links)
• An algorithm and efficient data structures for the binary knapsack problem (Q1255893) (← links)
• A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
• Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem (Q3586262) (← links)
• A o(n logn) algorithm for LP knapsacks with GUB constraints (Q3854926) (← links)
• Redundancy optimization by linear knapsack approach (Q3944310) (← links)
• The pure fixed charge transportation problem (Q3960466) (← links)
• A branch and bound algorithm for the generalized assignment problem (Q4066849) (← links)
• Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670) (← links)
• An algorithm for the 0/1 Knapsack problem (Q4149230) (← links)
• A generalized knapsack problem with variable coefficients (Q4173196) (← links)
• The Collapsing 0–1 Knapsack Problem (Q4175049) (← links)