IE 517 Heuristic Methods in Optimization
Credit Information:
(3+0+0) 3
Description:
Introduction to heuristic methods; classical construction heuristics; classical improvement heuristics; Lagrangean relaxation, simulated annealing, tabu search. Neural networks, genetic algorithms, ant colony optimization.
Prerequisite:
Consent of the instructor.
Offered by:
Syllabus:
