Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
ENM 509NETWORK OPTIMIZATION3 + 02nd Semester7,5

COURSE DESCRIPTION
Course Level Doctorate Degree
Course Type Elective
Course Objective Network flow problems are linear programming problems which have application areas in transportation, logistics, manufacturing, computer science, project management, finance. The aim of this course is to present basic network problems and give information about solution approaches.
Course Content Introduction to Network Theory, minimum spanning tree, minimum distance problems, maximum distance problems, maximum flow problems, transportation problems, transportation problems with connections, allocation problems,minimum cost flow problems, network simplex method, Project Networks, Euler graph, travelling salesman problems, vehicle routing problems.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to Face

COURSE LEARNING OUTCOMES
1Student gains the ability of modelling the network optimization problems.
2Student solves network optimization problems using appopriate methods
3Student recognizes the most widely used network optimization problems such as minimum distance, minimum spanning tree and maximum flow.

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10
LO 0015434211113
LO 0025424211113
LO 0035323211113
Sub Total1511711633339
Contribution5424211113

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)13113
Assignments5420
Mid-terms13535
Final examination14545
Report / Project14040
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