Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Matthias Köppe"'
Autor:
Velleda Baldoni, Nicole Berline, Brandon Dutra, Matthias Köppe, Michele Vergne, Jesus De Loera
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
For a given sequence $\alpha = [\alpha_1,\alpha_2,\ldots , \alpha_N, \alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\alpha)(t)$ that counts the nonnegative integer solutions of the equation $\alpha_1x_1+\alpha_2
Externí odkaz:
https://doaj.org/article/156237aa116447e2b16310af1159ddfd
Publikováno v:
PLoS ONE, Vol 7, Iss 4, p e35529 (2012)
Automatic design of synthetic gene circuits poses a significant challenge to synthetic biology, primarily due to the complexity of biological systems, and the lack of rigorous optimization methods that can cope with the combinatorial explosion as the
Externí odkaz:
https://doaj.org/article/40360d7de2024ca5804c1b5320f3b36b
Autor:
Jiawei Wang, Matthias Köppe
Publikováno v:
Discrete Applied Mathematics. 308:84-106
Within the framework of the superadditive duality theory of integer programming, we study two types of dual-feasible functions of a single real variable (Alves et al., 2016). We introduce software that automates testing piecewise linear functions for
Autor:
Yuan Zhou, Matthias Köppe
Publikováno v:
Mathematical Programming. 187:195-252
We investigate three competing notions that generalize the notion of a facet of finite-dimensional polyhedra to the infinite-dimensional Gomory–Johnson model. These notions were known to coincide for continuous piecewise linear functions with ratio
Autor:
Jiawei Wang, Matthias Köppe
Publikováno v:
Köppe, Matthias; & Wang, Jiawei. (2017). Structure and Interpretation of Dual-Feasible Functions. UC Davis: Department of Mathematics. Retrieved from: http://www.escholarship.org/uc/item/9wc9g4ss
We study two techniques to obtain new families of classical and general Dual-Feasible Functions: A conversion from minimal Gomory--Johnson functions; and computer-based search using polyhedral computation and an automatic maximality and extremality t
Publikováno v:
Journal of Global Optimization. 68:685-711
We study the spatial Brand-and-Bound algorithm for the global optimization of nonlinear problems. In particular we are interested in a method to find quickly good feasible solutions. Most spatial Branch-and-Bound-based solvers use a non-global solver
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030179526
IPCO
IPCO
The non-extreme minimal valid functions for the Gomory–Johnson infinite group problem are those that admit effective perturbations. For a class of piecewise linear functions for the 1-row problem we give a precise description of the space of these
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c96f7a5d052dd353dca0181584059e09
https://doi.org/10.1007/978-3-030-17953-3_19
https://doi.org/10.1007/978-3-030-17953-3_19
Publikováno v:
Mathematical Programming. 163:301-358
We develop foundational tools for classifying the extreme valid functions for the k-dimensional infinite group problem. In particular, we present the general regular solution to Cauchy's additive functional equation on restricted lower-dimensional co
Publikováno v:
SIAM Journal on Discrete Mathematics. 30:1470-1479
We investigate the arithmetic-geometric structure of the lecture hall cone \[ L_n \ := \ \left\{\lambda\in \mathbb{R}^n: \, 0\leq \frac{\lambda_1}{1}\leq \frac{\lambda_2}{2}\leq \frac{\lambda_3}{3}\leq \cdots \leq \frac{\lambda_n}{n}\right\} . \] We
Autor:
Jiawei Wang, Matthias Köppe
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319961507
ISCO
ISCO
Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of cut-generating funct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::944411baf2a6530adee205f49b6cc6e0
https://doi.org/10.1007/978-3-319-96151-4_23
https://doi.org/10.1007/978-3-319-96151-4_23