The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Recent Internet applications, such as online social networks and user-generated content sharing, produce an unprecedented amount of social information, which is further augmented b...
Nicolas Kourtellis, Joshua Finnis, Paul Anderson, ...
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...