Pages that link to "Item:Q380482"
From MaRDI portal
The following pages link to A conic approximation method for the 0-1 quadratic knapsack problem (Q380482):
Displaying 8 items.
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Second order optimality conditions and reformulations for nonconvex quadratically constrained quadratic programming problems (Q2438409) (← links)
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem (Q2890419) (← links)
- (Q3134089) (← links)
- Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem (Q5741470) (← links)
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints (Q6534829) (← links)