Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Ingo Stallknecht"'
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
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
We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if the constrai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::023695738d8e7541a9179d42ae658d4b