default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristopher Hojny
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Danny Blom
, Christopher Hojny, Bart Smeulders:
Cutting Plane Approaches for the Robust Kidney Exchange Problem. Comput. Oper. Res. 162: 106470 (2024)- [j16]Jasper van Doornmalen, Christopher Hojny:
Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs. INFORMS J. Comput. 36(3): 868-883 (2024) - [j15]Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. Math. Program. 205(1): 745-771 (2024) - [j14]Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
A simple method for convex optimization in the oracle model. Math. Program. 206(1): 283-304 (2024) - [c7]Christopher Hojny, Shiqiang Zhang, Juan S. Campos, Ruth Misener:
Verifying message-passing neural networks via topology-based bounds tightening. ICML 2024 - [i7]Christopher Hojny, Shiqiang Zhang, Juan S. Campos, Ruth Misener:
Verifying message-passing neural networks via topology-based bounds tightening. CoRR abs/2402.13937 (2024) - 2023
- [j13]Jasper van Doornmalen, Christopher Hojny, Roel Lambers, Frits C. R. Spieksma:
Integer programming models for round robin tournaments. Eur. J. Oper. Res. 310(1): 24-33 (2023) - [j12]Jan Pablo Burgard, Carina Moreira Costa, Christopher Hojny, Thomas Kleinert, Martin Schmidt:
Mixed-integer programming techniques for the minimum sum-of-squares clustering problem. J. Glob. Optim. 87(1): 133-189 (2023) - [j11]Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Computational aspects of relaxation complexity: possibilities and limitations. Math. Program. 197(2): 1173-1200 (2023) - [j10]Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Efficient MIP techniques for computing the relaxation complexity. Math. Program. Comput. 15(3): 549-580 (2023) - [j9]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:
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023) - [c6]Christopher Hojny, Marc E. Pfetsch:
Handling Symmetries in Mixed-Integer Semidefinite Programs. CPAIOR 2023: 69-78 - [c5]Christopher Hojny, Altan Berdan Kilic, Alberto Ravagnani:
The Role of the Alphabet in Network Coding: An Optimization Approach. ITW 2023: 526-531 - 2022
- [c4]Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
A Simple Method for Convex Optimization in the Oracle Model. IPCO 2022: 154-167 - [c3]Daniel Kowalczyk, Roel Leus, Christopher Hojny, Stefan Røpke:
A flow-based formulation for parallel machine scheduling problems using decision diagrams. ISAIM 2022 - [i6]Manuel Aprile, Gennadiy Averkov, Marco Di Summa, Christopher Hojny:
The role of rationality in integer-programming relaxations. CoRR abs/2206.12253 (2022) - [i5]Daniel Kowalczyk, Roel Leus, Christopher Hojny, Stefan Røpke:
A flow-based formulation for parallel machine scheduling using decision diagrams. CoRR abs/2210.02434 (2022) - [i4]Christopher Hojny, Altan Berdan Kilic, Alberto Ravagnani:
Network Coding: An Optimization Approach. CoRR abs/2212.07230 (2022) - 2021
- [j8]Christopher Hojny:
Strong IP formulations need large coefficients. Discret. Optim. 39: 100624 (2021) - [j7]Christopher Hojny, Imke Joormann, Hendrik Lüthen, Martin Schmidt:
Mixed-integer programming techniques for the connected max-k-cut problem. Math. Program. Comput. 13(1): 75-132 (2021) - [c2]Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
Computational Aspects of Relaxation Complexity. IPCO 2021: 368-382 - 2020
- [j6]Christopher Hojny, Tristan Gally, Oliver Habeck, Hendrik Lüthen, Frederic Matter, Marc E. Pfetsch, Andreas Schmitt:
Knapsack polytopes: a survey. Ann. Oper. Res. 292(1): 469-517 (2020) - [j5]Christopher Hojny:
Packing, partitioning, and covering symresacks. Discret. Appl. Math. 283: 689-717 (2020) - [j4]Christopher Hojny:
Polynomial size IP formulations of knapsack may require exponentially large coefficients. Oper. Res. Lett. 48(5): 612-618 (2020) - [i3]Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge:
Simple Iterative Methods for Linear Optimization over Convex Sets. CoRR abs/2011.08557 (2020)
2010 – 2019
- 2019
- [j3]Christopher Hojny, Marc E. Pfetsch:
Polytopes associated with symmetry handling. Math. Program. 175(1-2): 197-240 (2019) - [j2]Christopher Hojny, Hendrik Lüthen, Marc E. Pfetsch:
Sparsity of integer formulations for binary programs. Oper. Res. Lett. 47(5): 348-352 (2019) - [i2]Christopher Hojny, Marc E. Pfetsch, Matthias Walter:
Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials. CoRR abs/1911.06894 (2019) - 2017
- [c1]Christopher Hojny, Marc E. Pfetsch, Andreas Schmitt:
Extended Formulations for Column Constrained Orbitopes. OR 2017: 197-203 - 2016
- [j1]Christopher Hojny, Marc E. Pfetsch:
A polyhedral investigation of star colorings. Discret. Appl. Math. 208: 59-78 (2016) - 2015
- [i1]Christopher Hojny, Marc E. Pfetsch:
Symmetry Handling via Symmetry Breaking Polytopes. CTW 2015: 63-66
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-04 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
