Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
ENM 515NETWORK OPTIMIZATION3 + 01st Semester7,5

COURSE DESCRIPTION
Course Level Doctorate Degree
Course Type Elective
Course Objective
Course Content Modeling network problems, algorithms and computational analysis of networks, graph theory, shortest path problems, maximum flow problems, computer applications, minimum cost network flow problems, minimum spanning trees, assignment and matching problems, network-simplex technique
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1-
1-
1-

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10
LO 001          
Sub Total          
Contribution0000000000

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14228
Assignments51260
Mid-terms13535
Final examination13030
Total Work Load

ECTS Credit of the Course






195

7,5
COURSE DETAILS
 Select Year   


This course is not available in selected semester.


Print

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes