Pages that link to "Item:Q3569825"
From MaRDI portal
The following pages link to An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming (Q3569825):
Displaying 6 items.
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints (Q473861) (← links)
- On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
- An accelerating branch-and-bound algorithm for the sum of quadratic ratios problem (Q2886647) (← links)
- A branch-and-bound reduced method for a class of non-negative integer quadratic programming problems (Q2886654) (← links)
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs (Q2901026) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)