2 citations · 2 across the 5 of their papers we have counts for
4 papers · 1 filter
Branch-and-price strikes back for the k-vertex cut problem
Fabio Ciccarelli, Fabio Furini, Christopher Hojny +1
Given an undirected graph, the k-vertex cut problem (k-VCP) asks for a minimum-cost set of vertices whose removal yields at least k connected components in the resulting graph. The…
A Framework for Handling and Exploiting Symmetry in Benders Decomposition
Christopher Hojny, Cédric Roy
Benders decomposition (BD) is a framework for solving optimization problems by removing some variables and modeling their contribution to the original problem via so-called Benders…
Computational Aspects of Lifted Cover Inequalities for Knapsacks with Few Different Weights
Christopher Hojny, Cédric Roy
Cutting planes are frequently used for solving integer programs. A common strategy is to derive cutting planes from building blocks or a substructure of the integer program. In thi…
Verifying message-passing neural networks via topology-based bounds tightening
Christopher Hojny, Shiqiang Zhang, Juan S. Campos +1
Since graph neural networks (GNNs) are often vulnerable to attack, we need to know when we can trust them. We develop a computationally effective approach towards providing robust…