Pages that link to "Item:Q3754439"
From MaRDI portal
The following pages link to A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm (Q3754439):
Displaying 5 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)
- Linear Reformulations of Integer Quadratic Programs (Q3627671) (← links)
