Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Christopher Hojny"'
Publikováno v:
European Journal of Operational Research. 310:24-33
Round robin tournaments are omnipresent in sport competitions and beyond. We propose two new integer programming formulations for scheduling a round robin tournament, one of which we call the matching formulation. We analytically compare their linear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfc1abe500433fb195f3f4e8512c43cb
https://doi.org/10.1016/j.ejor.2023.02.017
https://doi.org/10.1016/j.ejor.2023.02.017
Publikováno v:
Mathematical Programming, 197(2), 1173-1200. Springer
The relaxation complexity $${{\,\mathrm{rc}\,}}(X)$$ rc ( X ) of the set of integer points X contained in a polyhedron is the smallest number of facets of any polyhedron P such that the integer points in P coincide with X. It is a useful tool to inve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6fec53fb2e2f167fc910906d1e612ea
https://doi.org/10.1007/s10107-021-01754-8
https://doi.org/10.1007/s10107-021-01754-8
Publikováno v:
LINEAR ALGEBRA AND ITS APPLICATIONS
Linear Algebra and Its Applications, 645, 30-51. Elsevier
Linear Algebra and Its Applications, 645, 30-51. Elsevier
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 assumption in several well-known eigenvalue bounds. In this work we aim to fur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::618b9b639ede0ec85ccf34dc13aecc40
https://doi.org/10.1016/j.laa.2022.03.003
https://doi.org/10.1016/j.laa.2022.03.003
Autor:
Ksenia Bestuzheva, Mathieu Besançon, Wei-Kun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco 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
Publikováno v:
ACM Transactions on Mathematical Software.
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP . The focus of this paper is on the role of the SCIP Optimization Suite in supporti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::578d0e2e73fb9ca5703e6f8eacf8b413
https://doi.org/10.1145/3585516
https://doi.org/10.1145/3585516
Publikováno v:
Journal of Global Optimization.
The minimum sum-of-squares clustering problem is a very important problem in data mining and machine learning with very many applications in, e.g., medicine or social sciences. However, it is known to be NP-hard in all relevant cases and to be notori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d243cdf74cee7cde493625656722922
https://doi.org/10.1007/s10898-022-01267-4
https://doi.org/10.1007/s10898-022-01267-4
Autor:
Christopher Hojny, Marc E. Pfetsch
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783031332708
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::746c610e266a18f91a845e0198ba5428
https://doi.org/10.1007/978-3-031-33271-5_5
https://doi.org/10.1007/978-3-031-33271-5_5
Autor:
Christopher Hojny
Publikováno v:
Operations Research Letters, 48(5), 612-618. Elsevier
A desirable property of integer formulations is to consist of few inequalities having small coefficients. We show that these targets are conflicting by proving the existence of knapsack sets that need exponentially many inequalities or exponentially
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28fa79663d056334b958829ca060819b
https://doi.org/10.1016/j.orl.2020.07.013
https://doi.org/10.1016/j.orl.2020.07.013
Publikováno v:
Mathematical Programming Computation, 13, 75-132. Springer
We consider an extended version of the classical Max-$$k$$ k -Cut problem in which we additionally require that the parts of the graph partition are connected. For this problem we study two alternative mixed-integer linear formulations and review exi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd619eeb7053bb05f9bd9533eac3f432
https://doi.org/10.1007/s12532-020-00186-3
https://doi.org/10.1007/s12532-020-00186-3
The relaxation complexity $${{\,\textrm{rc}\,}}(X)$$ rc ( X ) of the set of integer points X contained in a polyhedron is the minimal number of inequalities needed to formulate a linear optimization problem over X without using auxiliary variables. B
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c7576c0a436c3876a47ad9cd5e434c9
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::261be4d94423b29800f32e586e0e6449
https://doi.org/10.1007/978-3-031-06901-7_12
https://doi.org/10.1007/978-3-031-06901-7_12