Heuristics - 097333
Will not be given the year
|
|
|
| |
Lecture |
Exercise |
Laboratory |
Project or
Seminar |
House
Work |
Weekly
Hours |
2 |
1 |
|
|
5 |
|
Possibility to guided reading
Determination of the grade according to progress during the semester and the submission of the final thesis
|
Prerequisites:
| |
(
| | Deterministic Models in Oper.Research |
094313
| |
| | |
and
| Probability (Advanced) |
094412
| |
| | |
and
| Introduction to Statistics |
094423
| ) |
Introduction to Heuristics: Neighborhood Search, Random Search, Simulated Annealing, Tabu Search, Genetic Algorithms and Simulated Entropy Method. Computational Complexity of Local Search Algorithms. Introduction to Markov Chain Monte Carlo, Metropolis Algorithm. Case Studies and Applications.
Textbooks| Published | Publisher | Authors | Book |
|---|
| 1997 | .john wiley and sons | .aarts e. and lenstra j.k | .local search in combinatorial optimization |
Created in 08/03/2021 Time 15:06:03
