COURSE UNIT TITLE  COURSE UNIT CODE  SEMESTER  THEORY + PRACTICE (Hour)  ECTS 
INTEGER PROGRAMMING 
END622 
Program Course List 
3 + 0 
10 
TYPE OF COURSE UNIT  Elective Course 
LEVEL OF COURSE UNIT  Doctorate Of Science 
YEAR OF STUDY   
SEMESTER  Program Course List 
NUMBER OF ECTS CREDITS ALLOCATED  10 
NAME OF LECTURER(S)  Professor İmdat Kara

LEARNING OUTCOMES OF THE COURSE UNIT 
At the end of this course, the students; 1) Knowing the basics of integer programming 2) Learning the solution methods of integer programming models 3) Knowing the applications of integer programming and having ability to develop integer programming models and to solve them

MODE OF DELIVERY  Face to face 
PREREQUISITES OF THE COURSE  No 
RECOMMENDED OPTIONAL PROGRAMME COMPONENT  None 
COURSE DEFINITION  Methods and models of integer programming. Variants of integer programming models, pure and mixed integer models. Enumeration techniques, 01 integer programming and branch and bound method. Combinatorial optimization, heuristic methods and the applications of dynamic programming. Nonlinear integer programming models. Resource distribution, plant layout, integer programming approaches for scheduling and budgeting. 
COURSE CONTENTS  WEEK  TOPICS 

1^{st} Week  Methods for integer programming  2^{nd} Week  Models for integer programming  3^{rd} Week  Variations of integer programming models  4^{th} Week  Integer programming models and mixed integer programming models  5^{th} Week  Enumeration techniques  6^{th} Week  01 integer programming  7^{th} Week  BranchandBound method  8^{th} Week  Midterm  9^{th} Week  Combinatorial optimization  10^{th} Week  Heuristic methods and Dynamic Programming applications  11^{th} Week  Nonlinear integer models  12^{th} Week  Resource allocation  13^{th} Week  Facility location and layout and, integer programming in scheduling and  14^{th} Week  budgeting  15^{th} Week  Project Presentation 

RECOMENDED OR REQUIRED READING  1. Wolsey, L.A., Integer Programming, AwileyInterscience Publication New York, 1998. 2. Nemhauser, G., Integer and combinatorial optimization, AwileyInterscience Publication New York, 1999. 3. Bazaraa M.S., Jarvis J.J., Sherali H.D., 1990, Linear Programming and Network Flows 2nd ed., John Wiley & Sons 4. Hillier F.S., Lieberman G.J., 2001, Introduction to Operations Research (7th ed.), Mc GrawHill 
PLANNED LEARNING ACTIVITIES AND TEACHING METHODS  Lecture,Questions/Answers,Problem Solving,Practice,Presentation 
ASSESSMENT METHODS AND CRITERIA   Quantity  Percentage(%) 

Midterm  1  25  Assignment  4  20  Project  1  20  Attendance  1  5  Total(%)   70  Contribution of Interm Studies to Overall Grade(%)   70  Contribution of Final Examination to Overall Grade(%)   30  Total(%)   100 

LANGUAGE OF INSTRUCTION  Turkish 
WORK PLACEMENT(S)  No 
 
KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO) 
 LO1  LO2  LO3  K1  X  X  X  K2  X  X   K3  X  X   K4   X  X  K5   X   K6     K7     K8     K9     K10     K11     