Artificial Immune Systems Can Find Arbitrarily Good Approximations for the NP-Hard Partition Problem.
Dogan CorusPietro S. OlivetoDonya YazdaniPublished in: CoRR (2018)
Keyphrases
- artificial immune system
- np hard
- numerical optimization
- genetic algorithm
- artificial immune
- computational intelligence
- clonal selection
- clonal selection algorithm
- special case
- multiobjective optimization
- scheduling problem
- optimal solution
- lower bound
- computational intelligence methods
- swarm intelligence
- computational systems
- immune systems
- branch and bound algorithm
- job shop scheduling problem
- approximation methods
- computational complexity
- knapsack problem
- evolutionary computation
- computational model
- particle swarm optimization
- multi objective
- knowledge base