Pages that link to "Item:Q1186274"
From MaRDI portal
The following pages link to Local minima for indefinite quadratic knapsack problems (Q1186274):
Displaying 10 items.
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs (Q1906278) (← links)
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← links)
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
- (Q3028231) (← links)
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
