ISE 6220
Transcript Abbreviation
(N/A)
Course Description:
Introduction to continuous and discrete network optimization. Topics include shortest path, maximum flow minimum cut, minimum cost network flows algorithms, network design, and algorithms.
Course Levels
(N/A)
Designation
(N/A)
General Education Course
(N/A)
Cross-Listings
(N/A)
Credit Hours (Minimum if “Range”selected):
3.00
Max Credit Hours:
3.00
Select if Repeatable:
Off
Maximum Repeatable Credits
(N/A)
Total Completions Allowed
(N/A)
Allow Multiple Enrollments in Term:
No
Course Length:
14 weeks (autumn or spring)
12 weeks (summer only)
Off Campus:
Never
Campus Location:
Columbus
Instruction Modes
(N/A)
Prerequisites and Co-requisites:
Prereq: Calculus, Linear Algebra, Introductory Computer Programming, and Linear Programming.
Electronically Enforced:
No
Exclusions
(N/A)
Course Goals / Objectives:
Model optimization problems on networks
Design and analyze efficient algorithms
Understand various single source, all-pairs shortest path algorithms
Understand various max flow min cut algorithms
Design decomposition or approximation algorithms for discrete network optimization problems.
Check if concurrence sought:
No
Contact Hours
(N/A)
Grading Plan:
Letter Grade
Course Components:
Lecture
Grade Roster Component:
Lecture
Credit by Exam (EM):
No
Grades Breakdown:
| Aspect | Percent |
|---|---|
| No Grade Breakdown Entered. | |
Representative Textbooks and Other Course Materials:
| Title | Author | Year |
|---|---|---|
| No Textbooks and Other Course Materials Entered. | ||
ABET-CAC Criterion 3 Outcomes
(N/A)
ABET-ETAC Criterion 3 Outcomes
(N/A)
ABET-EAC Criterion 3 Outcomes
(N/A)
Embedded Literacies Info
(N/A)
Attachments
(N/A)
Additional Notes or Comments
(N/A)