COURSE UNIT TITLE

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR FIDAN NURIYEVA

Offered to

Ph.D. in Computer Science (English)
Computer Science

Course Objective

The aim of the course is to give an advanced mathematical methodology of the modern heuristics for important combinatorial optimization problems together with the computational complexity considerations.

Learning Outcomes of the Course Unit

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Recomended or Required Reading

Textbook(s):
1. Papadimitriou C.H., Steiglitz K., Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1998.

Supplementary Book(s):
2. Kellerer, H., Pferschy U., Pisinger D., Knapsack Problems, Springer, 2004.
3. Korte, B., Vygen, J., Combinatorial Optimization: Theory and Algorithms, 4th Edition (Algorithms and Combinatorics), Springer, 2008.
4. Martello, S., Toth, P., Knapsack Problems: Algorithms and Computer Implementations,John Wiley &Sons, 1990.
5. Edited by Ding-Zhu Du, Panos M. Pardolos, Handbook of Combinatorial Optimization (Volume A), Kluwer, 1999.
6. Edited by Ding-Zhu Du, Panos M. Pardolos, Handbook of Combinatorial Optimization (Volume B), Kluwer, 1999.
7. Lawler Eugene, Combinatorial Optimization Network and Matroids, 2001.
8. Nemhauser G. L., Wolsey L. A., Integer and Combinatorial Optimization, John Wiley&Sons, 1988.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

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)

fidan.nuriyeva@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Contribution of Learning Outcomes to Programme Outcomes