| 000 | 00826 a2200241 4500 | ||
|---|---|---|---|
| 005 | 20250516051928.0 | ||
| 264 | 0 | _c20120307 | |
| 008 | 201203s 0 0 eng d | ||
| 022 | _a1530-9304 | ||
| 024 | 7 |
_a10.1162/EVCO_a_00047 _2doi |
|
| 040 |
_aNLM _beng _cNLM |
||
| 100 | 1 | _aDoerr, Benjamin | |
| 245 | 0 | 0 |
_aTight analysis of the (1+1)-EA for the single source shortest path problem. _h[electronic resource] |
| 260 |
_bEvolutionary computation _c2011 |
||
| 300 |
_a673-91 p. _bdigital |
||
| 500 | _aPublication Type: Journal Article | ||
| 650 | 0 | 4 | _aAlgorithms |
| 650 | 0 | 4 |
_aMathematics _xmethods |
| 700 | 1 | _aHapp, Edda | |
| 700 | 1 | _aKlein, Christian | |
| 773 | 0 |
_tEvolutionary computation _gvol. 19 _gno. 4 _gp. 673-91 |
|
| 856 | 4 | 0 |
_uhttps://doi.org/10.1162/EVCO_a_00047 _zAvailable from publisher's website |
| 999 |
_c21082780 _d21082780 |
||