Christopher Hojny

From MaRDI portal
Person:284836

Available identifiers

zbMath Open hojny.christopherMaRDI QIDQ284836

List of research outcomes





PublicationDate of PublicationType
Enabling research through the SCIP Optimization Suite 8.02024-09-10Paper
A simple method for convex optimization in the oracle model2024-08-20Paper
Efficient propagation techniques for handling cyclic symmetries in binary programs2024-07-29Paper
The role of rationality in integer-programming relaxations2024-04-09Paper
Fairness in Graph-Theoretical Optimization Problems2023-11-27Paper
The Impact of Symmetry Handling for the Stable Set Problem via Schreier-Sims Cuts2023-11-10Paper
A proof system for certifying symmetry and optimality reasoning in integer programming2023-11-07Paper
Handling symmetries in mixed-integer semidefinite programs2023-10-04Paper
Efficient MIP techniques for computing the relaxation complexity2023-09-08Paper
Mixed-integer programming techniques for the minimum sum-of-squares clustering problem2023-08-02Paper
Integer programming models for round Robin tournaments2023-07-11Paper
Computational aspects of relaxation complexity: possibilities and limitations2023-03-14Paper
Enabling Research through the SCIP Optimization Suite 8.02023-03-13Paper
Handling Sub-symmetry in Integer Programming using Activation Handlers2022-12-08Paper
A Unified Framework for Symmetry Handling2022-11-02Paper
A simple method for convex optimization in the oracle model2022-08-16Paper
Characterizing and computing weight-equitable partitions of graphs2022-04-28Paper
Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs2022-03-02Paper
Computational aspects of relaxation complexity2021-12-21Paper
The SCIP Optimization Suite 8.02021-12-16Paper
Mixed-integer programming techniques for the connected max-\(k\)-cut problem2021-11-16Paper
Schreier-Sims Cuts meet Stable Set: Preserving Problem Structure when Handling Symmetries2021-11-15Paper
Computational Aspects of Relaxation Complexity: Possibilities and Limitations2021-05-26Paper
Cutting Plane Approaches for the Robust Kidney Exchange Problem2021-05-18Paper
Strong IP formulations need large coefficients2021-04-21Paper
Polynomial size IP formulations of knapsack may require exponentially large coefficients2021-04-07Paper
Packing, partitioning, and covering symresacks2020-06-29Paper
Sparsity of integer formulations for binary programs2020-02-10Paper
Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials2019-11-15Paper
Polytopes associated with symmetry handling2019-05-17Paper
https://portal.mardi4nfdi.de/entity/Q46175832019-02-06Paper
A polyhedral investigation of star colorings2016-05-18Paper
The SCIP Optimization Suite 9.0N/APaper

Research outcomes over time

This page was built for person: Christopher Hojny