COURSE UNIT TITLE

: CONSTRAINT PROGRAMMING

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
IND 5024 CONSTRAINT PROGRAMMING ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

PROFESSOR DOCTOR ŞEYDA AYŞE YILDIZ

Offered to

INDUSTRIAL ENGINEERING (ENGLISH)
Industrial Engineering - Thesis (English) (Evening Program)
INDUSTRIAL ENGINEERING (ENGLISH)
INDUSTRIAL ENGINEERING - NON THESIS (ENGLISH)
INDUSTRIAL ENGINEERING - NON THESIS (EVENING PROGRAM) (ENGLISH)

Course Objective

The course aims to provide an introduction to combinatorial optimization and to give an understanding of constraint programming solution technique to solve combinatorial problems.

Learning Outcomes of the Course Unit

1   To get the students acquainted with combinatorial optimization problems in practice
2   To develop the students' mathematical modeling abilities in defining combinatorial optimization problems
3   To get the students acquainted with basic methodologies underlying the constraint programming technique
4   To make the students use a constraint programming tool

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to combinatorial optimization, complexity of combinatorial optimization problems (COPs)
2 Applications of combinatorial optimization
3 Overview of solution techniques for COPs
4 Introduction to constraint constraint programming, constraint satisfaction problems in operations research
5 Introduction to constraint programming algorithms
6 Constraint propagation and domain reduction
7 Combining backtracking seearch and constraint propagation
8 Search and strategies for constraint programming, variable and value ordering, optimization algorithms
9 Midterm
10 Comparison of constraint programming to mixed integer programming and hybrid strategies
11 Overview of IBM ILOG Optimization Suite
12 Problem solving using IBM ILOG Optimization Suite
13 Project Presentations
14 Project Presentations

Recomended or Required Reading

Selected material from literature on constraint programming
IBM ILOG OPL Language User's Manual, 2009

References:
K. Marriott, P.J. Stuckey. Programming with Constraints. MIT Press, 1998
Michela Milano (ed.) Constraint and Integer Programming Towards a Unified Approach. Kluwer academic Publishers, 2004

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, student presentations are organized and they are presented at the scheduled lectures for all the students.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 ASG ASSIGNMENT
2 PRS PRESENTATION
3 FCG FINAL COURSE GRADE ASG * 0.50 + PRS * 0.50


Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

Assoc.Prof.Dr. Şeyda Topaloğlu
e-mail: seyda.topaloglu@deu.edu.tr
Tel : 301 7611

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 12 3 36
Preparations before/after weekly lectures 12 1 12
Preparing assignments 3 20 60
Preparing presentations 1 25 25
Project Preparation 1 40 40
Preparing report 1 30 30
Project Assignment 1 2 2
Project Final Presentation 1 2 2
TOTAL WORKLOAD (hours) 207

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.12311231
LO.2331231
LO.33311
LO.43341121

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS