The DOI matches its Crossref record.
Knapsack Problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
Lei, L., Yuan, D., Ho, C. K., & Sun, S. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2616310 · Cited by 328
An efficient power scheduling scheme for residential load management in smart homes
Rasheed, M., Javaid, N., Ahmad, A., Khan, Z., Qasim, U., & Alrajeh, N. (2015) · Applied Sciences · doi:10.3390/app5041134 · Cited by 134
Movers and shakers: kinetic energy harvesting for the internet of things
Gorlatova, M., Sarik, J., Grebla, G., Cong, M., Kymissis, I., & Zussman, G. (2014) · The 2014 ACM international conference on Measurement and modeling of computer systems · doi:10.1145/2591971.2591986 · Cited by 79
Metadata
- Authors
- Kellerer, H., Pferschy, U., & Pisinger, D.
- Venue
- Springer eBooks
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- OpenAlex
- W4236127247
- Cited by
- 1,824
- References
- 0
- FWCI
- 68.22
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Knapsack Problems. https://app.cochat.ai/papers/10.1007/978-3-540-24777-7
- The paper
- Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack Problems. Springer eBooks. https://doi.org/10.1007/978-3-540-24777-7
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
