Classical optimization tools as simplex-based enumeration tend to behave poorly in minimax combinatorial optimization problems due to degeneracy. I will discuss the use of two tools to handle these classes of problems: binary search and sampling. I will exemplify their use in two problems: the minimax diameter clustering problem and the p-center problem. Applications to graph partitioning will be briefly discussed.
Watch the presentaion live here: https://univofmontreal.adobeconnect.com/_a1019300341/rc4tsl7ix46v/.
Coffee and biscuits will be offered at the beginning of the seminar.
Welcome to everyone!