Hochschulschrift
Solving planning problems with noisy objective functions : a comparison of genetic algorithms, simulated annealing, and tabu search, and the effect of noise on their performance
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
20 cm
- Umfang
-
XX, 215 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Frankfurt (Main), Univ., Diss., 2001
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
- 11.06.2025, 14:04 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)
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Solving the frequency assignment problem with simulated annealing
Solving NP-complete Problems with Metaheuristics: An Introduction to Tabu Search, Simulated Annealing and Late Acceptance
Solving the medical student scheduling problem using simulated annealing
Applied simulated annealing
Intelligent optimisation techniques : genetic algorithms, tabu search, simulated annealing and neural networks
Voll datenparalleles simulated annealing
Dreidimensionale Packprobleme : Lösungsverfahren basierend auf den Meta-Heuristiken simulated annealing und Tabu-Suche
Finite time bounds for Simulated Annealing
Classical Simulated Annealing Using Quantum Analogues
Some Remarks on Replicated Simulated Annealing
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Solving the frequency assignment problem with simulated annealing
Solving NP-complete Problems with Metaheuristics: An Introduction to Tabu Search, Simulated Annealing and Late Acceptance
Solving the medical student scheduling problem using simulated annealing
Applied simulated annealing
Intelligent optimisation techniques : genetic algorithms, tabu search, simulated annealing and neural networks
Voll datenparalleles simulated annealing
Dreidimensionale Packprobleme : Lösungsverfahren basierend auf den Meta-Heuristiken simulated annealing und Tabu-Suche
Finite time bounds for Simulated Annealing
Classical Simulated Annealing Using Quantum Analogues
Some Remarks on Replicated Simulated Annealing
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Solving an one-dimensional cutting stock problem by simulated annealing and tabu search
Solving the frequency assignment problem with simulated annealing
Solving NP-complete Problems with Metaheuristics: An Introduction to Tabu Search, Simulated Annealing and Late Acceptance
Solving the medical student scheduling problem using simulated annealing
Applied simulated annealing
Intelligent optimisation techniques : genetic algorithms, tabu search, simulated annealing and neural networks
Voll datenparalleles simulated annealing
Dreidimensionale Packprobleme : Lösungsverfahren basierend auf den Meta-Heuristiken simulated annealing und Tabu-Suche
Finite time bounds for Simulated Annealing
Classical Simulated Annealing Using Quantum Analogues