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

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

Bioinspired computation in combinatorial optimization: algorithms and their computational complexity

Open access
Neumann, Frank, Witt, Carsten·2012·Proceedings of the 14th annual conference companion on Genetic and evolutionary computation

Abstract

Bioinspired computation methods, such as evolutionary algorithms and ant colony optimization, are being applied successfully to complex engineering and combinatorial optimization problems, and it is very important that we understand the computational complexity of these algorithms. This tutorials explains the most important results achieved in this area.The presenters show how runtime behavior can be analyzed in a rigorous way, in particular for combinatorial optimization. They present well-known problems such as minimum spanning trees, shortest paths, maximum matching, and covering and scheduling problems. Classical single objective optimization is examined first. They then investigate the computational complexity of bioinspired computation applied to multiobjective variants of the considered combinatorial optimization problems, and in particular they show how multiobjective optimization can help to speed up bioinspired computation for single-objective optimization problems.The tutorial is based on a book written by the authors with the same title. Further information about the book can be found at www.bioinspiredcomputation.com.

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.

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

Integrity signals

Registry

Crossref · 10.1145/2330784.2330928

Cites

31 of 31 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 31 references

Cited by

See all 319

Metadata

Authors
Neumann, F., & Witt, C.
Venue
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Publisher
ACM
Published
2012-07-07
Pages
1035-1058
OpenAlex
W2100137329
Cited by
319
References
31
FWCI
27.21
Type
journal article
Language
en
Open access
green

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: Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. https://app.cochat.ai/papers/10.1145/2330784.2330928
The paper
Neumann, F., & Witt, C. (2012). Bioinspired computation in combinatorial optimization: algorithms and their computational complexity. Proceedings of the 14th annual conference companion on Genetic and evolutionary computation. https://doi.org/10.1145/2330784.2330928

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.