Christopher Hojny

According to our database, Christopher Hojny authored at least 30 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth.

Gennadiy Averkov, Christopher Hojny, Maximilian Merkert

CoRR, February, 2025

2024

A simple method for convex optimization in the oracle model.

Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge

Math. Program., July, 2024

The role of rationality in integer-programming relaxations.

Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny

Math. Program., May, 2024

Cutting Plane Approaches for the Robust Kidney Exchange Problem.

Danny Blom, Christopher Hojny, Bart Smeulders

Comput. Oper. Res., February, 2024

A Flow-Based Formulation for Parallel Machine Scheduling Using Decision Diagrams.

Daniel Kowalczyk, Roel Leus, Christopher Hojny, Stefan Røpke

INFORMS J. Comput., 2024

Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs.

Jasper van Doornmalen, Christopher Hojny

INFORMS J. Comput., 2024

Verifying message-passing neural networks via topology-based bounds tightening.

Christopher Hojny, Shiqiang Zhang, Juan S. Campos, Ruth Misener

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Fairness in Graph-theoretical Optimization Problems.

Christopher Hojny, Frits C. R. Spieksma, Sten Wessel

Proceedings of the 3rd European Workshop on Algorithmic Fairness, 2024

2023

Efficient MIP techniques for computing the relaxation complexity.

Gennadiy Averkov, Christopher Hojny, Matthias Schymura

Math. Program. Comput., September, 2023

Mixed-integer programming techniques for the minimum sum-of-squares clustering problem.

Jan Pablo Burgard, Carina Moreira Costa, Christopher Hojny, Thomas Kleinert, Martin Schmidt

J. Glob. Optim., September, 2023

Enabling Research through the SCIP Optimization Suite 8.0.

Ksenia Bestuzheva, Mathieu Besançon, Weikun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros M. Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig

ACM Trans. Math. Softw., June, 2023

Computational aspects of relaxation complexity: possibilities and limitations.

Gennadiy Averkov, Christopher Hojny, Matthias Schymura

Math. Program., February, 2023

Integer programming models for round robin tournaments.

Jasper van Doornmalen, Christopher Hojny, Roel Lambers, Frits C. R. Spieksma

Eur. J. Oper. Res., 2023

The Role of the Alphabet in Network Coding: An Optimization Approach.

Christopher Hojny, Altan Berdan Kilic, Alberto Ravagnani

Proceedings of the IEEE Information Theory Workshop, 2023

Handling Symmetries in Mixed-Integer Semidefinite Programs.

Christopher Hojny, Marc E. Pfetsch

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022

Network Coding: An Optimization Approach.

Christopher Hojny, Altan Berdan Kilic, Alberto Ravagnani

CoRR, 2022

A flow-based formulation for parallel machine scheduling problems using decision diagrams.

Daniel Kowalczyk, Roel Leus, Christopher Hojny, Stefan Røpke

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

2021

Mixed-integer programming techniques for the connected max-k-cut problem.

Christopher Hojny, Imke Joormann, Hendrik Lüthen, Martin Schmidt

Math. Program. Comput., 2021

Strong IP formulations need large coefficients.

Christopher Hojny

Discret. Optim., 2021

Computational Aspects of Relaxation Complexity.

Gennadiy Averkov, Christopher Hojny, Matthias Schymura

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020

Polynomial size IP formulations of knapsack may require exponentially large coefficients.

Christopher Hojny

Oper. Res. Lett., 2020

Packing, partitioning, and covering symresacks.

Christopher Hojny

Discret. Appl. Math., 2020

Simple Iterative Methods for Linear Optimization over Convex Sets.

Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge

CoRR, 2020

Knapsack polytopes: a survey.

Christopher Hojny, Tristan Gally, Oliver Habeck, Hendrik Lüthen, Frederic Matter, Marc E. Pfetsch, Andreas Schmitt

Ann. Oper. Res., 2020

2019

Sparsity of integer formulations for binary programs.

Christopher Hojny, Hendrik Lüthen, Marc E. Pfetsch

Oper. Res. Lett., 2019

Polytopes associated with symmetry handling.

Christopher Hojny, Marc E. Pfetsch

Math. Program., 2019

Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials.

Christopher Hojny, Marc E. Pfetsch, Matthias Walter

CoRR, 2019

2017

Extended Formulations for Column Constrained Orbitopes.

Christopher Hojny, Marc E. Pfetsch, Andreas Schmitt

Proceedings of the Operations Research Proceedings 2017, 2017

2016

A polyhedral investigation of star colorings.

Christopher Hojny, Marc E. Pfetsch

Discret. Appl. Math., 2016

2015

Symmetry Handling via Symmetry Breaking Polytopes.

Christopher Hojny, Marc E. Pfetsch

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015