IE 414 - Heuristic Methods in Combinatorial Optimization

Institution:

Lehigh University

Subject:

Description:

Heuristic methods for solving combinatorial and discrete optimization problems such as routing, scheduling, partitioning and layout. Introduction to NP-completeness theory, exact and inexact methods, performance analysis, fast and greedy heuristics, Lagrangean heuristics, and various search techniques including simulated annealing, genetic algorithms, Tabu search and iterative constructive heuristics.

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.lehigh.edu

Phone Number:

(610) 758-3000

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.