An Improved Solution to the Duplicate Subsets Issue in the Subset Sum Problem

This paper proposes an enhanced method for handling duplicate subsetsin the Subset Sum problem, extending a previously published solution.The content is presented in both English and Arabic.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-12-23
DOI
https://doi.org/10.5281/zenodo.18038630
Primary Topic
Genome Rearrangement Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved Solution to the Duplicate Subsets Issue in the Subset Sum Problem

houssem drablia
Zenodo (CERN European Organization for Nuclear Research)
Genome Rearrangement Algorithms
article

An Improved Solution to the Duplicate Subsets Issue in the Subset Sum Problem

houssem drablia
article en

Abstract

This paper proposes an enhanced method for handling duplicate subsetsin the Subset Sum problem, extending a previously published solution.The content is presented in both English and Arabic.

Zenodo (CERN European Organization for Nuclear Research)
Openalex Percentile: Top 25%
Genome Rearrangement Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Improved Solution to the Duplicate Subsets Issue in the Subset Sum Problem — houssem drablia · Zenodo (CERN European Organization for Nuclear Research) (2025) | TGRS Research Map | TGRS