Fast algorithm for the quadratic knapsack problem
From MaRDI portal
Recommendations
- A direct algorithm of separable quadratic knapsack problem
- scientific article; zbMATH DE number 6263683
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- A library for continuous convex separable quadratic knapsack problems
- An O(n) algorithm for quadratic knapsack problems
Cites work
- A library for continuous convex separable quadratic knapsack problems
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Introduction to algorithms.
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Quasi-Newton Updates with Bounds
Cited in
(10)- A library for continuous convex separable quadratic knapsack problems
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- An approximate dynamic programming approach to convex quadratic knapsack problems
- scientific article; zbMATH DE number 2124285 (Why is no real title available?)
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- A direct algorithm of separable quadratic knapsack problem
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Linear time algorithms for some separable quadratic programming problems
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- An O(n) algorithm for quadratic knapsack problems
This page was built for publication: Fast algorithm for the quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674729)
