The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
New trends in exact algorithms for the 0–1 knapsack problem
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
Cites
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Knapsack Problems: Algorithms and Computer Implementations
Connolly, D., Martello, S., & Toth, P. (1991) · Journal of the Operational Research Society · doi:10.2307/2583458 · Cited by 3,120
Self-citationDiscrete-Variable Extremum Problems
Dantzig, G. B. (1957) · Operations Research · doi:10.1287/opre.5.2.266 · Cited by 910
Computing Partitions with Applications to the Knapsack Problem
Horowitz, E., & Sahni, S. K. (1974) · Journal of the ACM · doi:10.1145/321812.321823 · Cited by 605
An Algorithm for Large Zero-One Knapsack Problems
Balas, E., & Zemel, E. (1980) · Operations Research · doi:10.1287/opre.28.5.1130 · Cited by 469
A Minimal Algorithm for the 0-1 Knapsack Problem
Pisinger, D. (1997) · Operations Research · doi:10.1287/opre.45.5.758 · Cited by 253
Self-citation
Cited by
A survey of recent developments in multiobjective optimization
Chinchuluun, A., & Pardalos, P. M. (2007) · Annals of Operations Research · doi:10.1007/s10479-007-0186-0 · Cited by 323
Introducing a new intelligent adaptive learning content generation method
Haghshenas, E., Mazaheri, A., Gholipour, A., Tavakoli, M., Zandi, N., Narimani, H., Rahimi, F., & Nouri, S. (2010) · The Second International Conference on E-Learning and E-Teaching (ICELET 2010) · doi:10.1109/icelet.2010.5708382 · Cited by 14
Metadata
- Authors
- Martello, S., Pisinger, D., & Toth, P.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2000-06
- Volume
- 123
- Issue
- 2
- Pages
- 325-332
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2037698864
- Cited by
- 292
- References
- 6
- FWCI
- 31.24
- Type
- journal article
- 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: New trends in exact algorithms for the 0–1 knapsack problem. https://app.cochat.ai/papers/10.1016/s0377-2217(99)00260-x
- The paper
- Martello, S., Pisinger, D., & Toth, P. (2000). New trends in exact algorithms for the 0–1 knapsack problem. European Journal of Operational Research. https://doi.org/10.1016/s0377-2217(99)00260-x
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.