Pages that link to "Item:Q3754439"

The following pages link to A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm (Q3754439):

Displaying 9 items.

• Extending the QCR method to general mixed-integer programs (Q662304) (← links)
• A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
• Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
• A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
• A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626) (← links)
• Linear Reformulations of Integer Quadratic Programs (Q3627671) (← links)
• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (Q4835455) (← links)
• Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
• A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (Q5058729) (← links)