Abstract: Multiprocessor task scheduling problem has become increasingly interesting, for both theoretical study and practical applications. Theoretical study of the problem has made significant ...

Combinatorial optimisation problems arise in many fields, from logistics and network design to machine learning and bioinformatics. Most classical formulations are NP-hard, rendering exact ...

Abstract: Noncommutative constraint satisfaction problems (CSPs) are higher-dimensional operator extensions of classical CSPs. Their approximability remains largely unexplored. A notable example of a ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

This project explores the NP-hard problem of scheduling unrelated parallel machines, a significant challenge in optimizing resource utilization. Specifically, it focuses on efficiently assigning ...

Here are a some implementations of various approximation algorithms for the optimal Travelling Salesperson Tour in 2D Euclidean Space. Additionally there are some helper algorithms such as Kruskal's ...