On Friday 17 November 2017, our colleague Raad Salman presented and defended his licentiate thesis “Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem”.
The work introduces new problems, concepts and algorithms within the field of combinatorial optimization. It is also of practical industrial importance as it enables more efficient planning of robot sequencing and workload distribution for robot stations where certain tasks must be performed before other tasks may be considered.
We congratulate Raad and look forward to keep working with him here at FCC!
See full text thesis here!