Go to Main Content

SCT WWW Information System

 

HELP | EXIT

Detailed Course Information

 

Fall 2013 Semester
Jul 05, 2020
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

EECE 7360 - Combinatorial Optimization
Introduces combinatorial optimization, an emerging field that combines techniques from applied mathematics, operations research, and computer science to solve optimization problems over discrete structures. Emphasizes problems that arise in the areas of electrical and computer engineering including VLSI, computer-aided design, parallel computing, computer architecture, and high-performance compiling. Covers the foundations of algorithm analysis including asymptotic notation and complexity theory, and a range of optimization techniques including divide and conquer, local optimization, dynamic programming, branch and bound, simulated annealing, genetic algorithms, approximation algorithms, integer and linear programming, matroid theory, and greedy algorithms. Considers the efficient generation of optimal solutions, the development and evaluation of heuristics, and the computation of tight upper and lower bounds. Prereq. Engineering students only.
4.000 Credit hours
4.000 Lecture hours

Levels: Graduate
Schedule Types: Lecture

Electrical and Comp Engineerng Department

Course Attributes:
GSEN Engineering

Restrictions:
Must be enrolled in one of the following Levels:     
      Graduate
Must be enrolled in one of the following Colleges:     
      College of Engineering

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4