Within the department of Quantitative Economics at the Maastricht University School of Business and Economics, we organize monthly research lunches. Here, academics present their ongoing research on various topics in the field of Operations Research.
If you wish to attend an upcoming session, do not hesitate to get in touch! A list of upcoming OR seminars is given below.
There are no future events.
Past OR lunch seminars:
“Toward the smoothed analysis of k-jump neighborhood”
In this talk, we consider the problem of scheduling jobs on identical parallel machines to minimize the makespan. We analyze a simple local search method w.r.t. the so-called k-jump neighborhood. We will talk about the worst-case running time of the algorithm. The idea of the research is to see whether the worst-case running time can be improved by applying smoothed analysis.
“Bi-objective Path Planning with Objectives of Minimizing Length and Maximizing Clearance”
Path planning problem is one of the challenging problems in the field of computer science and robotics. Because of its widespread crucial applications, it is, therefore, not surprising that research activity on this problem and its different versions has been steadily increasing over the last two decades. In this thesis, we study the problem of bi-objective path planning among polygonal obstacles with the objectives of minimizing the length and maximizing the clearance of the path, that is, maximizing the minimum distance between the path and the obstacles. The goal is to find all Pareto optimal paths.