Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated to ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

The stochastic root-finding problem is that of finding a zero of a vector-valued function known only through a stochastic simulation. The simulation-optimization problem is that of locating a ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.