Thesis supervisor: József Békési
Location of studies (in Hungarian): SZTE Abbreviation of location of studies: SZTE
Description of the research topic:
Combinatorial optimization is a discipline that seeks optimal solutions to certain problems using discrete mathematical and computing tools. It has been a rapidly evolving field in recent decades, particularly because it has specific applications. The models designed by the researchers can be successfully applied in fields such as economics, environmental sciences, public transport, industrial production and much more.
The majority of the problems examined are mathematically and algorithmically difficult, which means that an algorithm capable of efficiently solving larger-scale tasks is unknown. Often it is very unlikely that such a method exists. Therefore, research is focused on developing optimization algorithms that work efficiently on specific practical problems. Even though, at worst, they can take a very long time to complete, even on today's state-of-the-art computers. Because of the theoretical difficulty of finding an optimal solution, our aim is to find methods that provide good solutions within a reasonable time. From a theoretical point of view, we consider algorithms for which we can give advance guarantees of efficiency. For example, in an optimization problem, we want to know how the value given by the approximation algorithm is related to the optimal value.
The main objective of the research topic is to develop new online or other approximation or exact algorithms for various special scheduling problems. We call an algorithm online if it receives the data in parts and always has to make decisions based on the information already available without information on the next parts. These algorithms are usually analyzed on the basis of competitive analysis, which gives a worst case ratio on the cost of the solution obtained by the online algorithm compared to the cost of the optimal solution.
Optionally theoretical research, or applied research related to specific practical problems, such as transport can be chosen.
Recommended language skills (in Hungarian): angol Number of students who can be accepted: 1
Deadline for application: 2024-09-15
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Login
