PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
CENG 523	COMBINATORIAL OPTIMIZATION AND ALGORITHMS	3 + 0	2nd Semester	7,5

COURSE DESCRIPTION

Course Level	Master's Degree
Course Type	Elective
Course Objective	By the end of this course, students should be able to: Formulate and utilize heuristic solution procedures for different types of design problems,understand the difference between construction and improvement heuristics, and understand the limitations of any heuristic solution approach
Course Content	The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.
Prerequisites	No the prerequisite of lesson.
Corequisite	No the corequisite of lesson.
Mode of Delivery	Face to Face

COURSE LEARNING OUTCOMES

1	Formulate and utilize heuristic solution procedures for different types of design problems,
2	understand the difference between construction and improvement heuristics
3	understand the limitations of any heuristic solution approach

COURSE'S CONTRIBUTION TO PROGRAM

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION

Activities	Quantity	Duration (Hour)	Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)	14	3	42
Hours for off-the-classroom study (Pre-study, practice)	14	5	70
Assignments	5	8	40
Mid-terms	1	15	15
Final examination	1	28	28
Total Work Load ECTS Credit of the Course			195 7,5

COURSE DETAILS

Select Year

This course is not available in selected semester.

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

Prospective Student