Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Martin Henk"'
Autor:
Marcel Celaya, Martin Henk
Publikováno v:
Mathematical Programming, 197 (2)
We study proximity bounds within a natural model of random integer programs of the type max c(inverted perpendicular) x : Ax = b, x is an element of Z(>= 0), where A is an element of Z(mxn) is of rank m, b is an element of Z(m) and c is an element of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2af0fedfdb1d257262cfb656ed55a55a
https://doi.org/10.1007/s10107-022-01786-8
https://doi.org/10.1007/s10107-022-01786-8
Elementary flux modes (EFMs) play a prominent role in the constraint-based analysis of metabolic networks. They correspond to minimal functional units of the metabolic network at steady-state and as such have been studied for almost 30 years. The set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ceb4a9d6867656e58e2616a0261f68d
https://doi.org/10.1101/2022.09.24.509324
https://doi.org/10.1101/2022.09.24.509324
Autor:
Jörg M. Wills, Martin Henk
Publikováno v:
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry. 62:265-280
In this survey we give an overview about some of the main results on parametric densities, a concept which unifies the theory of finite (free) packings and the classical theory of infinite packings.
16 pages, 5 figures
16 pages, 5 figures
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc7280488ee0d061973c384f2876a4f2
https://doi.org/10.1007/s13366-020-00502-x
https://doi.org/10.1007/s13366-020-00502-x
Recently, K.-Y. Wu introduced affine subspace concentration conditions for the cone volumes of polytopes and proved that the cone volumes of centered, reflexive, smooth lattice polytopes satisfy these conditions. We extend the result to arbitrary cen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57511145ec5528fdb898ba8ed006546d
Autor:
Martin Henk, Sören Lennart Berg
Publikováno v:
Mosc. J. Comb. Number Theory 8, no. 4 (2019), 367-378
As a discrete counterpart to the classical theorem of Fritz John on the approximation of symmetric n-dimensional convex bodies K by ellipsoids, Tao and Vu introduced so called generalized arithmetic progressions P(A,b)⊂ℤn in order to cover (many
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc1c33df447c8e6113e8f6b6fc1af98e
https://doi.org/10.2140/moscow.2019.8.367
https://doi.org/10.2140/moscow.2019.8.367
Publikováno v:
Mathematical Programming. 182:175-198
We give an optimal upper bound for the maximum-norm distance from a vertex of a knapsack polyhedron to its nearest feasible lattice point. In a randomised setting, we show that the upper bound can be significantly improved on average. As a corollary,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1d357b5874d49f11ad173444e279171
https://doi.org/10.1007/s10107-019-01392-1
https://doi.org/10.1007/s10107-019-01392-1
Autor:
Marcel Celaya, Martin Henk
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030738785
IPCO
IPCO
We study proximity bounds within a natural model of random integer programs of the type \(\max \varvec{c}^{\top }\varvec{x}:\varvec{A}\varvec{x}=\varvec{b},\,\varvec{x}\in \mathbb {Z}_{\ge 0}\), where \(\varvec{A}\in \mathbb {Z}^{m\times n}\) is of r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b81fc1c93dd6ee537400a14822e36dee
https://doi.org/10.1007/978-3-030-73879-2_29
https://doi.org/10.1007/978-3-030-73879-2_29
Publikováno v:
Communications Earth & Environment, Vol 5, Iss 1, Pp 1-9 (2024)
Abstract Declining Arctic sea ice over recent decades has been linked to growth in coastal hazards affecting the Alaskan Arctic. In this study, climate model projections of sea ice are utilized in the simulation of an extratropical cyclone to quantif
Externí odkaz:
https://doaj.org/article/d191e38a13134323a96c7b5b26603762
We obtain a transference bound for vertices of corner polyhedra that connects two well-established areas of research: proximity and sparsity of solutions to integer programs. In the knapsack scenario, it gives an exponential (in the size of support o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ec5b7db41ebd4d6b0e7c6e3b97a5afb2
http://arxiv.org/abs/2007.00950
http://arxiv.org/abs/2007.00950
Autor:
Ansgar Freyer, Martin Henk
Gardner et al. posed the problem to find a discrete analogue of Meyer’s inequality bounding from below the volume of a convex body by the geometric mean of the volumes of its slices with the coordinate hyperplanes. Motivated by this problem, for wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ede91dbee342202927f2c2fb96c36e50
http://arxiv.org/abs/2004.14097
http://arxiv.org/abs/2004.14097