Hochschulschrift
Combinatorial optimization and the analysis of randomized search heuristics
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
143 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Kiel, Univ., Diss., 2006
- Urheber
- URN
-
urn:nbn:de:gbv:8-diss-18081
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:29 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Random combinatorial structures and randomized search heuristics
Optimization Heuristics for the Combinatorial Auction Problem
Randomized search heuristics as an alternative to exact optimization
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Search for nash-equilibria by optimization heuristics
Upper and lower bounds for randomized search heuristics in black box optimization
Learning Heuristics for Combinatorial Optimization Problems with Deep Neural Networks
Towards a theory of randomized search heuristics
Computing minimum cuts by randomized search heuristics
Computing Minimum Cuts by Randomized Search Heuristics
Optimization with Randomized Search Heuristics : The (A)NFL Theorem,Realistic Scenarios, and Difficult Functions
Algorithmics for hard problems : introduction to combinatorial optimization, randomization, approximation, and heuristics
Random combinatorial structures and randomized search heuristics
Optimization Heuristics for the Combinatorial Auction Problem
Randomized search heuristics as an alternative to exact optimization
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Search for nash-equilibria by optimization heuristics
Upper and lower bounds for randomized search heuristics in black box optimization
Learning Heuristics for Combinatorial Optimization Problems with Deep Neural Networks
Towards a theory of randomized search heuristics
Computing minimum cuts by randomized search heuristics
Computing Minimum Cuts by Randomized Search Heuristics
Optimization with Randomized Search Heuristics : The (A)NFL Theorem,Realistic Scenarios, and Difficult Functions
Algorithmics for hard problems : introduction to combinatorial optimization, randomization, approximation, and heuristics
Random combinatorial structures and randomized search heuristics
Optimization Heuristics for the Combinatorial Auction Problem
Randomized search heuristics as an alternative to exact optimization
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Search for nash-equilibria by optimization heuristics
Upper and lower bounds for randomized search heuristics in black box optimization
Learning Heuristics for Combinatorial Optimization Problems with Deep Neural Networks
Towards a theory of randomized search heuristics
Computing minimum cuts by randomized search heuristics
Computing Minimum Cuts by Randomized Search Heuristics
Optimization with Randomized Search Heuristics : The (A)NFL Theorem,Realistic Scenarios, and Difficult Functions