• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS BIL 3006 COMBINATORIAL OPTIMIZATION COMPULSORY 4 0 0 7

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASISTANT PROFESSOR MURAT ERŞEN BERBERLER

Offered to

Computer Science

Course Objective

To teach combinatorial optimization concepts to solve computer science problems.

Learning Outcomes of the Course Unit

1   Have a knowledge of basic concepts of combinatorial optimization. 2   Be able to solve problems of combinatorial optimization. 3   Be able to solve computer science problems by using combinatorial optimization concepts. 4   Be able to design efficient algorithms by using combinatorial optimization concepts. 5   Be able to solve problems of different type of disciplines by using concepts of combinatorial optimization.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Problems and algorithms 2 Optimal trees and paths 3 Maximum flow problems 4 Minimum cost flow problems Quiz 1 5 Optimal matchings 6 Integrality of polyhedra 7 The travelling salesman problem 8 Mid-term exam 9 Matroids 10 P Class integer programming problems 11 NP Class integer programming problems 12 Branch and bound algorithm Quiz 2 13 Branch and cut algorithm 14 Dynamic programming NP, NP-completeness and approximation algorithms

Recomended or Required Reading

Textbook(s): Combinatorial Optimizaiton, William J. Cook, W.H.C., W.R.P., A.S., ISBN 047155894.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 QUZ QUIZ 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE MTE * 0.30 + QUZ * 0.20 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + QUZ * 0.20 + RST * 0.50

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

murat.berberler@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 4 52 Preparations before/after weekly lectures 12 6 72 Preparation for midterm exam 1 10 10 Preparation for final exam 1 20 20 Preparation for quiz etc. 2 8 16 Final 1 2 2 Midterm 1 2 2 Quiz etc. 2 1 2 TOTAL WORKLOAD (hours) 176

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 PO.12 PO.13 LO.1 4 LO.2 5 5 LO.3 4 5 5 LO.4 5 5 LO.5 5 5