ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1806.00300
  4. Cited By
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
Dogan Corus
P. S. Oliveto
Donya Yazdani
ArXiv (abs)PDFHTML

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

14 / 14 papers shown
Title
On Inversely Proportional Hypermutations with Mutation Potential
On Inversely Proportional Hypermutations with Mutation Potential
Dogan Corus
P. S. Oliveto
Donya Yazdani
27
6
0
27 Mar 2019
On the Benefits of Populations on the Exploitation Speed of Standard
  Steady-State Genetic Algorithms
On the Benefits of Populations on the Exploitation Speed of Standard Steady-State Genetic Algorithms
Dogan Corus
P. S. Oliveto
36
32
0
26 Mar 2019
Fast Artificial Immune Systems
Fast Artificial Immune Systems
Dogan Corus
P. S. Oliveto
Donya Yazdani
47
28
0
01 Jun 2018
When Hypermutations and Ageing Enable Artificial Immune Systems to
  Outperform Evolutionary Algorithms
When Hypermutations and Ageing Enable Artificial Immune Systems to Outperform Evolutionary Algorithms
Dogan Corus
P. S. Oliveto
Donya Yazdani
33
28
0
04 Apr 2018
A General Dichotomy of Evolutionary Algorithms on Monotone Functions
A General Dichotomy of Evolutionary Algorithms on Monotone Functions
Johannes Lengler
42
58
0
25 Mar 2018
Probabilistic Tools for the Analysis of Randomized Optimization
  Heuristics
Probabilistic Tools for the Analysis of Randomized Optimization Heuristics
Benjamin Doerr
53
173
0
20 Jan 2018
Theoretical Analysis of Stochastic Search Algorithms
Theoretical Analysis of Stochastic Search Algorithms
Per Kristian Lehre
P. S. Oliveto
41
18
0
04 Sep 2017
Standard Steady State Genetic Algorithms Can Hillclimb Faster than
  Mutation-only Evolutionary Algorithms
Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms
Dogan Corus
P. S. Oliveto
34
113
0
04 Aug 2017
Approximating Optimization Problems using EAs on Scale-Free Networks
Approximating Optimization Problems using EAs on Scale-Free Networks
Ankit Chauhan
Tobias Friedrich
Francesco Quinzan
13
7
0
12 Apr 2017
Fast Genetic Algorithms
Fast Genetic Algorithms
Benjamin Doerr
H. P. Le
Régis Makhmara
Ta Duy Nguyen
40
204
0
09 Mar 2017
On the Runtime of Randomized Local Search and Simple Evolutionary
  Algorithms for Dynamic Makespan Scheduling
On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling
Frank Neumann
Carsten Witt
58
33
0
23 Apr 2015
Level-based Analysis of Genetic Algorithms and other Search Processes
Level-based Analysis of Genetic Algorithms and other Search Processes
Dogan Corus
D. Dang
A. Eremeev
Per Kristian Lehre
64
144
0
29 Jul 2014
A Parameterized Complexity Analysis of Bi-level Optimisation with
  Evolutionary Algorithms
A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms
Dogan Corus
Per Kristian Lehre
Frank Neumann
M. Pourhassan
49
21
0
09 Jan 2014
More Effective Crossover Operators for the All-Pairs Shortest Path
  Problem
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
Benjamin Doerr
Daniel Johannsen
Timo Kotzing
Frank Neumann
M. Theile
78
53
0
02 Jul 2012
1