Keywords
Knapsack problemAlgorithmMathematicsQuadratic equationCombinatoricsComputer scienceMathematical optimizationGeometry
Affiliated Institutions
Related Publications
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
A linear space algorithm for computing maximal common subsequences
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadra...
A Variational Method in Image Recovery
This paper is concerned with a classical denoising and deblurring problem in image recovery. Our approach is based on a variational method. By using the Legendre--Fenchel transf...
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f ∈ C N and a randomly chosen set of freque...
Estimating the power spectrum of the cosmic microwave background
We develop two methods for estimating the power spectrum, C_l, of the cosmic microwave background (CMB) from data and apply them to the COBE/DMR and Saskatoon datasets. One meth...
Publication Info
- Year
- 1984
- Type
- article
- Volume
- 3
- Issue
- 3
- Pages
- 163-166
- Citations
- 212
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
212
OpenAlex
Cite This
Peter Brucker
(1984).
An O(n) algorithm for quadratic knapsack problems.
Operations Research Letters
, 3
(3)
, 163-166.
https://doi.org/10.1016/0167-6377(84)90010-5
Identifiers
- DOI
- 10.1016/0167-6377(84)90010-5