Artificial Immune Systems Can Find Arbitrarily Good Approximations for
the NP-Hard Number Partitioning Problem

v1v2 (latest)

Artificial Immune Systems Can Find Arbitrarily Good Approximations for the NP-Hard Number Partitioning Problem

1 June 2018

ArXiv (abs)PDF HTML

Papers citing "Artificial Immune Systems Can Find Arbitrarily Good Approximations for the NP-Hard Number Partitioning Problem"

6 / 6 papers shown

Title
Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation D. Dang Andre Opris Dirk Sudholt 94 17 0 31 Jan 2023
Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1,2)-Minimum Spanning Tree Problem Feng Shi Frank Neumann Jian-xin Wang 16 4 0 10 Oct 2021
Lazy Parameter Tuning and Control: Choosing All Parameters Randomly From a Power-Law Distribution Denis Antipov M. Buzdalov Benjamin Doerr 131 31 0 14 Apr 2021
Fast Immune System Inspired Hypermutation Operators for Combinatorial Optimisation Dogan Corus P. S. Oliveto Donya Yazdani 31 9 0 01 Sep 2020
Fast Perturbative Algorithm Configurators George T. Hall P. S. Oliveto Dirk Sudholt 56 7 0 07 Jul 2020
On Inversely Proportional Hypermutations with Mutation Potential Dogan Corus P. S. Oliveto Donya Yazdani 32 6 0 27 Mar 2019