Zobrazeno 1 - 10
of 136
pro vyhledávání: '"Robert Weismantel"'
Autor:
Tilo Beyer, Mandy Busse, Kroum Hristov, Slavyana Gurbiel, Michal Smida, Utz-Uwe Haus, Kathrin Ballerstein, Frank Pfeuffer, Robert Weismantel, Burkhart Schraven, Jonathan A Lindquist
Publikováno v:
PLoS Computational Biology, Vol 7, Iss 8, p e1002121 (2011)
T cells orchestrate the adaptive immune response, making them targets for immunotherapy. Although immunosuppressive therapies prevent disease progression, they also leave patients susceptible to opportunistic infections. To identify novel drug target
Externí odkaz:
https://doaj.org/article/390deaeb0a4c4b90b68cc57b7921f00f
Autor:
Julio Saez-Rodriguez, Luca Simeoni, Jonathan A Lindquist, Rebecca Hemenway, Ursula Bommhardt, Boerge Arndt, Utz-Uwe Haus, Robert Weismantel, Ernst D Gilles, Steffen Klamt, Burkhart Schraven
Publikováno v:
PLoS Computational Biology, Vol 3, Iss 8, p e163 (2007)
Cellular decisions are determined by complex molecular interaction networks. Large-scale signaling networks are currently being reconstructed, but the kinetic parameters and quantitative data that would allow for dynamic modeling are still scarce. Th
Externí odkaz:
https://doaj.org/article/749b56d893044ac2bdd24a3f9fb493a2
Publikováno v:
Mathematical Programming.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2e648cc095d9aeb02f65c5ec69ee5bd
https://doi.org/10.1007/s10107-023-01971-3
https://doi.org/10.1007/s10107-023-01971-3
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031327254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe4ad8096515b2a9a66892d45eb0ec50
https://doi.org/10.1007/978-3-031-32726-1_4
https://doi.org/10.1007/978-3-031-32726-1_4
Publikováno v:
Vietnam Journal of Mathematics, 50 (2)
Let A ∈ Zm×n be an integral matrix and a, b, c ∈ Z satisfy a ≥ b ≥ c ≥ 0. The question is to recognize whether A is {a, b, c}-modular, i.e., whether the set of n×n subdeterminants of A in absolute value is {a, b, c}. We will succeed in so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5db48ef3add4356afda946a865a29da2
https://doi.org/10.1007/s10013-021-00520-9
https://doi.org/10.1007/s10013-021-00520-9
For a matrix $W \in \mathbb{Z}^{m \times n}$, $m \leq n$, and a convex function $g: \mathbb{R}^m \rightarrow \mathbb{R}$, we are interested in minimizing $f(x) = g(Wx)$ over the set $\{0,1\}^n$. We will study separable convex functions and sharp conv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d8d96f9d03b2fe359a21b1c596c7875
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031069000
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d00f86569e0b78d6dcb38579ec49f72e
https://doi.org/10.1007/978-3-031-06901-7_7
https://doi.org/10.1007/978-3-031-06901-7_7
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030738785
IPCO
IPCO
Let \(A \in \mathbb {Z}^{m \times n}\) be an integral matrix and \(a, b, c \in \mathbb {Z}\) satisfy \(a \ge b \ge c \ge 0\). The question is to recognize whether A is \(\{a,b,c\}\)-modular, i.e., whether the set of \(n \times n\) subdeterminants of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e075bdefc9683aef34fa0b19e79066dc
https://doi.org/10.1007/978-3-030-73879-2_17
https://doi.org/10.1007/978-3-030-73879-2_17
Autor:
Jana Cslovjecsek, Robert Weismantel, Lars Rohwedder, Christoph Hunkenschröder, Friedrich Eisenbrand
Publikováno v:
SODA
We consider integer and linear programming problems for which the linear constraints exhibit a (recursive) block-structure: The problem decomposes into independent and efficiently solvable sub-problems if a small number of constraints is deleted. A p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fda1a09ca311dbf1fb7a06b3e47f98e
https://doi.org/10.1137/1.9781611976465.101
https://doi.org/10.1137/1.9781611976465.101
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030457709
IPCO
IPCO
We introduce the integrality number of an integer program (IP) in inequality form. Roughly speaking, the integrality number is the smallest number of integer constraints needed to solve an IP via a mixed integer (MIP) relaxation. One notable property
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b2319bf2a172a3c43030b6736977bb4
https://doi.org/10.1007/978-3-030-45771-6_26
https://doi.org/10.1007/978-3-030-45771-6_26