Language of Instruction
|
English
|
Level of Course Unit
|
Bachelor's Degree
|
Department / Program
|
INDUSTRIAL ENGINEERING
|
Type of Program
|
Formal Education
|
Type of Course Unit
|
Elective
|
Course Delivery Method
|
Face To Face
|
Objectives of the Course
|
To provide an understanding of theory, algorithm and applications of combinatorial and integer optimization. To formulate IP models for some real-life decision-making problems and show why one model might be “better” than another equivalent model.
|
Course Content
|
This course introduces concepts, theories, and algorithms of integer and combinatorial optimization. Topics include modeling, comparison of alternative formulations, computational complexity, polyhedral theory, valid inequalities, cutting-plane algorithms, enumerative algorithms such as dynamic programming, branch-and-bound, branch-and-cut, heuristic algorithms and techniques to handle large problems such as Benders’ decomposition and delayed column generation (and branch-and-price). Applications include graphs, networks, transportation, and scheduling.
|
Course Methods and Techniques
|
We will be using various tools for active learning to take place. This is also a student-driven course. It is your responsibility to participate actively in class discussions.
|
Prerequisites and co-requisities
|
None
|
Course Coordinator
|
None
|
Name of Lecturers
|
Asist Prof.Dr. Rahime Şeyma Bekli seyma.bekli@agu.edu.tr
|
Assistants
|
None
|
Work Placement(s)
|
No
|
Recommended or Required Reading
Resources
|
Wolsey, Laurence A. Integer Programming. Wiley-Interscience, 1998.
|
|
will be shared on canvas
|
|
canvas uzerinden paylasilacaktir
|
|
canvas uzerinden paylasilacaktir
|
|
canvas uzerinden paylasilacaktir
|
|