Combinatorial optimisation algorithms are central to addressing problems in which the goal is to select an optimal solution from a finite set of alternatives. These algorithms have evolved ...

Graph algorithms and combinatorial optimisation form a pivotal area of research that underpins many modern computational applications. At their core, graph algorithms provide systematic methods for ...

In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with matchings and cover many results, extending the fundamental results of matchings, ...

Proper market segmentation schemes should address not only how to develop feasible schemes of homogeneous market segments within designated managerial, institutional, and environmental restrictions, ...

A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as ...

Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...

This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is not available as an outside option. Some familiarity with graph theory and some ...

Xinyun Wu: Post-doctoral Fellow during 2017-2018. Currently works at Hubei University of Technology as Assistant Professor in Computer Science. His research interests include design and analysis of ...