Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem (Q2321315)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem |
scientific article |
Statements
Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem (English)
0 references
28 August 2019
0 references
randomized search heuristics
0 references
evolutionary algorithms
0 references
artificial immune systems
0 references
approximation algorithms
0 references
makespan scheduling
0 references
0 references
0 references
0 references
0.7856485247612
0 references
0.7659302949905396
0 references
0.7325483560562134
0 references
0.7193596959114075
0 references
