The Subset-Sum Problem as an Optimization Problem

The subset-sum problem provides an essential role for numerous real-world applications such as coding theory and cryptography since it is the basis for several public key cryptography systems. This work deals with the subset-sum problem as an optimization problem with a variety of algorithms for tackling it. It additionally addresses its numerous applications. The experiments showed that the three developed systems are capable of providing the same known optimal results for the utilized benchmark data.

[1]  Gil Segev,et al.  Public-Key Cryptographic Primitives Provably as Secure as Subset Sum , 2010, TCC.

[2]  Nadia Abd-Alsabour,et al.  Investigating the effect of fixing the subset length on the performance of ant colony optimization for feature selection for supervised learning , 2015, Comput. Electr. Eng..

[3]  Shengxiang Yang,et al.  Dynamics in the Multi-objective Subset Sum: Analysing the Behavior of Population Based Algorithms , 2013 .

[4]  Thomas Bäck,et al.  An evolutionary approach to combinatorial optimization problems , 1994, CSC '94.

[5]  Chao Xu,et al.  Subset Sum Made Simple , 2018, ArXiv.

[6]  Daqing Wan,et al.  Counting subset sums of finite abelian groups , 2012, J. Comb. Theory A.

[7]  Weiqiong Wang,et al.  The k-subset sum problem over finite fields , 2018, Finite Fields Their Appl..

[8]  Enrique Alba,et al.  Parallel Genetic Algorithms , 2011, Studies in Computational Intelligence.

[9]  Nadia Abd-Alsabour,et al.  Hybrid Metaheuristics for Classification Problems , 2016 .

[10]  Ammar Daskin,et al.  A Quantum Approach to Subset-Sum and Similar Problems , 2017, ArXiv.

[11]  Christian Blum,et al.  Hybrid metaheuristics in combinatorial optimization: A survey , 2011, Appl. Soft Comput..

[12]  Jerry S. Kelly,et al.  NP-completeness of some problems concerning voting games , 1990 .

[13]  R Core Team,et al.  R: A language and environment for statistical computing. , 2014 .

[14]  Nadia Abd-Alsabour,et al.  Binary Ant Colony Optimization for Subset Problems , 2015, Multi-objective Swarm Intelligence.

[15]  Vittorio Maniezzo,et al.  VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH , 2008, Cybern. Syst..

[16]  Jyoti Gupta,et al.  On the Applicability of Genetic Algorithms in Subset Sum Problem , 2016 .

[17]  Lei Li,et al.  A Genetic Algorithm to Solve the Subset Sum Problem based on Parallel Computing , 2015 .

[18]  Nadia Abd-Alsabour,et al.  Local search for parallel optimization algorithms for high diminsional optimization problems , 2018 .

[19]  Nadia Abd-Alsabour.  Nature as a Source for Inspiring New Optimization Algorithms , 2017, ICSPS 2017.

[20]  Tanja Lange,et al.  Quantum Algorithms for the Subset-Sum Problem , 2013, PQCrypto.

[21]  Vitor Venceslau Curtis,et al.  A low-space algorithm for the subset-sum problem on GPU , 2017, Comput. Oper. Res..

[22]  Stefka Fidanova.  Ant Colony Optimization and Multiple Knapsack Problem , 2007 .