- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Reihe CI ; 203-06
- Event
-
Veröffentlichung
- (where)
-
Dortmund
- (who)
-
Universitätsbibliothek Dortmund
- (when)
-
2006
- Creator
-
Storch, Tobias
- Handle
-
2003/26111
- URN
-
urn:nbn:de:101:1-201606152776
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:57 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Storch, Tobias
- Universitätsbibliothek Dortmund
Time of origin
- 2006
Other Objects (12)
Computing minimum cuts by randomized search heuristics
Towards a theory of randomized search heuristics
Random combinatorial structures and randomized search heuristics
The maximum planar subgraph problem
Combinatorial optimization and the analysis of randomized search heuristics
On the size of weights in randomized search heuristics
Randomized search heuristics as an alternative to exact optimization
PlaNet : A Software Package of Algorithms and Heuristics on Planar Networks
Approximating covering problems by randomized search heuristics using multi-objective models
Toward a complexity theory for randomized search heuristics : black-box models
Worst-Case and Averange-Case Approximations by Simple Randomized Search Heuristics
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Computing minimum cuts by randomized search heuristics
Towards a theory of randomized search heuristics
Random combinatorial structures and randomized search heuristics
The maximum planar subgraph problem
Combinatorial optimization and the analysis of randomized search heuristics
On the size of weights in randomized search heuristics
Randomized search heuristics as an alternative to exact optimization
PlaNet : A Software Package of Algorithms and Heuristics on Planar Networks
Approximating covering problems by randomized search heuristics using multi-objective models
Toward a complexity theory for randomized search heuristics : black-box models
Worst-Case and Averange-Case Approximations by Simple Randomized Search Heuristics
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Computing minimum cuts by randomized search heuristics
Towards a theory of randomized search heuristics
Random combinatorial structures and randomized search heuristics
The maximum planar subgraph problem
Combinatorial optimization and the analysis of randomized search heuristics
On the size of weights in randomized search heuristics
Randomized search heuristics as an alternative to exact optimization
PlaNet : A Software Package of Algorithms and Heuristics on Planar Networks
Approximating covering problems by randomized search heuristics using multi-objective models
Toward a complexity theory for randomized search heuristics : black-box models
Worst-Case and Averange-Case Approximations by Simple Randomized Search Heuristics