Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 216

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A Modified Binary Particle Swarm Optimization for Knapsack Problems

Bansal, Jagdish Chand, Deep, Kusum · 2012 · Applied Mathematics and Computation

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.amc.2012.05.001

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

  • A new optimizer using particle swarm theory

    Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067 · cited 1×

    “The particle swarm optimization algorithm, originally introduced in terms of social and cognitive behaviour by Kennedy and Eberhart [40,41], solves problems in many fields, especially engineering and computer science.”
    Method

Cited by

See all 216

Metadata

Authors
Bansal, J. C., & Deep, K.
Venue
Applied Mathematics and Computation
Publisher
Elsevier BV
Published
2012-07
Volume
218
Issue
22
Pages
11042-11061
ISSN
0096-3003 (ISSN-L)
OpenAlex
W2094859983
Cited by
216
References
1
FWCI
10.77
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

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.