Optimization Methods in Management Science
Course Code:
8123
Semester:
5th
Compulsory Courses
Professor:
Course Description
- Introduction to Python Programming language
- Ordering Problems
- Traveling Salesman Problem
- Vehicle Routing Problem
- Assignment Problems
- 1-D Bin Packing Problem
- Linear Sum Assignment Problem
- Graph Colouring Problem
- Quadratic Assignment Problem
- Προβλήματα Επιλογής
- Set Covering Problem
- Weighted Set Covering Problem
- Knapsack Problem
- Shortest Path Problem
- Local Search
- Local Search Metaheuristics
- Classification Problems
- Clustering Problems
Learning Outcomes
Upon completion of this course, students will be able to:
- Identify the operational and strategic goals and constraints that govern the business problems solved during the class
- Distinguish the computational properties and computational characteristics of business problems
- Select and suggest the appropriate heuristic and metaheuristic techniques to solve the aforementioned problems
- Design heuristic and metaheuristic techniques to solve business problems involving big data.
- Compare the efficiency of the above heuristic and metaheuristic methods
- Develop the above heuristic and metaheuristic methods in Python
- Develop basic machine learning algorithms for classification and clustering problems