Christopher Hojny

Orcid: 0000-0002-5324-8996

According to our database1, Christopher Hojny authored at least 27 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The role of rationality in integer-programming relaxations.
Math. Program., May, 2024

Cutting Plane Approaches for the Robust Kidney Exchange Problem.
Comput. Oper. Res., February, 2024

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

2023
Efficient MIP techniques for computing the relaxation complexity.
Math. Program. Comput., September, 2023

Mixed-integer programming techniques for the minimum sum-of-squares clustering problem.
J. Glob. Optim., September, 2023

Enabling Research through the SCIP Optimization Suite 8.0.
ACM Trans. Math. Softw., June, 2023

Computational aspects of relaxation complexity: possibilities and limitations.
Math. Program., February, 2023

Integer programming models for round robin tournaments.
Eur. J. Oper. Res., 2023

The Role of the Alphabet in Network Coding: An Optimization Approach.
Proceedings of the IEEE Information Theory Workshop, 2023

Handling Symmetries in Mixed-Integer Semidefinite Programs.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

2022
Network Coding: An Optimization Approach.
CoRR, 2022

A flow-based formulation for parallel machine scheduling using decision diagrams.
CoRR, 2022

A flow-based formulation for parallel machine scheduling problems using decision diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

A Simple Method for Convex Optimization in the Oracle Model.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021
Mixed-integer programming techniques for the connected max-k-cut problem.
Math. Program. Comput., 2021

Strong IP formulations need large coefficients.
Discret. Optim., 2021

Computational Aspects of Relaxation Complexity.
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020
Polynomial size IP formulations of knapsack may require exponentially large coefficients.
Oper. Res. Lett., 2020

Packing, partitioning, and covering symresacks.
Discret. Appl. Math., 2020

Simple Iterative Methods for Linear Optimization over Convex Sets.
CoRR, 2020

Knapsack polytopes: a survey.
Ann. Oper. Res., 2020

2019
Sparsity of integer formulations for binary programs.
Oper. Res. Lett., 2019

Polytopes associated with symmetry handling.
Math. Program., 2019

Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials.
CoRR, 2019

2017
Extended Formulations for Column Constrained Orbitopes.
Proceedings of the Operations Research Proceedings 2017, 2017

2016
A polyhedral investigation of star colorings.
Discret. Appl. Math., 2016

2015
Symmetry Handling via Symmetry Breaking Polytopes.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015


  Loading...