A Projection Method for the Integer Quadratic Knapsack Problem
From MaRDI portal
Publication:4887719
Recommendations
Cited in
(13)- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- A relaxed projection method for general integer quadratic knapsack problem.
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- A breakpoint search approach for convex resource allocation problems with bounded variables
- A unified method for a class of convex separable nonlinear knapsack problems
- A pegging algorithm for the nonlinear resource allocation problem
- A survey on the continuous nonlinear resource allocation problem
- The nonlinear knapsack problem - algorithms and applications
- New algorithm for quadratic integer knapsack problems
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
This page was built for publication: A Projection Method for the Integer Quadratic Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887719)