Pages that link to "Item:Q6166654"
From MaRDI portal
The following pages link to Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654):
Displaying 3 items.
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← links)
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785) (← links)
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)