Evidence map›Paper›PMID 39451791›Full record

ArticleBiomimetics (Basel, Switzerland)2024

Set Packing Optimization by Evolutionary Algorithms with Theoretical Guarantees.

Youzhen Jin, Xiaoyun Xia, Zijia Wang, Xue Peng, Jun Zhang, Weizhi Liao

Abstract read
In one paragraph

Article in Biomimetics (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Youzhen JinSchool of Information Science and Engineering, Jiaxing University, Jiaxing 314001, China.
Xiaoyun XiaSchool of Information Science and Engineering, Jiaxing University, Jiaxing 314001, China.ORCID 0000-0001-7922-3343
Zijia WangSchool of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China.
Xue PengSchool of Mathematics and Systems Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China.
Jun ZhangCollege of Artificial Intelligence, Nankai University, Tianjin 300350, China.ORCID 0000-0001-7835-9871
Weizhi LiaoSchool of Information Science and Engineering, Jiaxing University, Jiaxing 314001, China.

Funding

Guangdong Natural Science Foundation 2022A1515011825Guangzhou Science and Technology Planning Project 2023A04J0388, 2023A03J0662National Natural Science Foundation of China 62106055, 61703183
6 · The paper itself

Abstract

The set packing problem is a core NP-complete combinatorial optimization problem which aims to find the maximum collection of disjoint sets from a given collection of sets,

Indexed as

approximation algorithmapproximation ratioevolutionary algorithmslocal searchperformance guaranteeruntime analysisset packing

Identifiers

PMID39451791
PMCPMC11504854

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.