67 citations · 72 across the 23 of their papers we have counts for
4 papers · 1 filter
Schreier-Sims Cuts meet Stable Set: Preserving Problem Structure when Handling Symmetries
Christopher Hojny, Marc E. Pfetsch, José Verschae
Symmetry handling inequalities (SHIs) are a popular tool to handle symmetries in integer programming. Despite their successful application in practice, only little is known about t…
Characterizing and computing weight-equitable partitions of graphs
Aida Abiad, Christopher Hojny, Sjanne Zeijlemaker
Weight-equitable partitions of graphs, which are a natural extension of the well-known equitable partitions, have been shown to be a powerful tool to weaken the regularity assumpti…
Computational Aspects of Relaxation Complexity: Possibilities and Limitations
Gennadiy Averkov, Christopher Hojny, Matthias Schymura
The relaxation complexity of the set of integer points contained in a polyhedron is the smallest number of facets of any polyhedron such that the integer p…
Cutting Plane Approaches for the Robust Kidney Exchange Problem
Danny Blom, Christopher Hojny, Bart Smeulders
Renal patients which have a willing but incompatible donor can decide to participate in a kidney exchange program (KEP). The goal of a KEP is to identify sets of such incompatible…