Pages that link to "Item:Q2076914"

The following pages link to A branch-and-bound algorithm for the quadratic multiple knapsack problem (Q2076914):

Displaying 16 items.

• An ejection chain approach for the quadratic multiple knapsack problem (Q323171) (← links)
• Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
• A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (Q1108931) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• Iterated responsive threshold search for the quadratic multiple knapsack problem (Q2341207) (← links)
• A new upper bound for the multiple knapsack problem (Q2668625) (← 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)
• (Q4387182) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (Q4835455) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• Lagrangian matheuristics for the quadratic multiple knapsack problem (Q6041829) (← links)
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)