Zobrazeno 1 - 10
of 389
pro vyhledávání: '"Uniform k 21 polytope"'
Autor:
Rafael Martí, Gerhard Reinelt
Publikováno v:
Exact and Heuristic Methods in Combinatorial Optimization ISBN: 9783662648766
The Linear Ordering Problem ISBN: 9783642167287
The Linear Ordering Problem ISBN: 9783642167287
So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::939311d62c6e5a4f76f7f3c3880cf3ba
https://doi.org/10.1007/978-3-662-64877-3_6
https://doi.org/10.1007/978-3-662-64877-3_6
Publikováno v:
European Journal of Combinatorics. 67:61-77
A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so called the f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7748197dd9258e4f598ae7dd1ba155ed
https://doi.org/10.1016/j.ejc.2017.07.005
https://doi.org/10.1016/j.ejc.2017.07.005
Autor:
Christoph Thäle, Zakhar Kabluchko
Publikováno v:
Proceedings of the American Mathematical Society. 146:1295-1303
Let P n P_n be an n n -dimensional regular polytope from one of the three infinite series (regular simplices, regular crosspolytopes, and cubes). Project P n P_n onto a random, uniformly distributed linear subspace of dimension d ≥ 2 d\geq 2 . We p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2be7462e61f841da0d720df5f61506d6
https://doi.org/10.1090/proc/13827
https://doi.org/10.1090/proc/13827
Publikováno v:
Israel Journal of Mathematics. 221:445-469
We study the absorbing invariant set of a dynamical system defined by a map derived from Error Diffusion, a greedy online approximation algorithm that minimizes the (Euclidean) norm of the cumulated error. This algorithm assigns a sequence of outputs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64cfbde87aa170259e565339a8f87c6f
https://doi.org/10.1007/s11856-017-1550-7
https://doi.org/10.1007/s11856-017-1550-7
Publikováno v:
Discrete Mathematics. 340:991-994
Let P be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope 풪 ( P ) is equal to that of the chain polytope C ( P ) . Furthermore, it will be shown that the degree sequence of the finite simpl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a4fc13a3dd63a26fa725084f4754023
https://doi.org/10.1016/j.disc.2017.01.005
https://doi.org/10.1016/j.disc.2017.01.005
Publikováno v:
Linear and Multilinear Algebra. 65:2064-2075
This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e., the Upper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15f1cc678c803857669dc84b763911ca
https://doi.org/10.1080/03081087.2017.1310178
https://doi.org/10.1080/03081087.2017.1310178
Publikováno v:
Bulletin of Mathematical Biology. 79:975-994
Understanding the face structure of the balanced minimal evolution (BME) polytope, especially its top-dimensional facets, is crucially important to phylogenetic applications. We show that BME polytope has a sub-lattice of its poset of faces which is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4151a3648b4773b22fd553190ca56b9d
https://doi.org/10.1007/s11538-017-0264-7
https://doi.org/10.1007/s11538-017-0264-7
Autor:
Anna O. Ivanova, Oleg V. Borodin
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 5-12 (2017)
Lebesgue (1940) proved that every 3-polytope P5 of girth 5 has a path of three vertices of degree 3. Madaras (2004) refined this by showing that every P5 has a 3-vertex with two 3-neighbors and the third neighbor of degree at most 4. This description
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57b5c91ceb5c81dd6dd67a9e4e5a359c
https://doaj.org/article/7787aa31e9fc473b9e27bdc4e3020fdb
https://doaj.org/article/7787aa31e9fc473b9e27bdc4e3020fdb
Autor:
Daniel Pellicer
Publikováno v:
Ars Mathematica Contemporanea. 12:315-327
In this paper we describe an infinite chiral 4 -polytope in the Euclidean 3 -space. This builds on previous work of Bracho, Hubard and the author, where a finite chiral 4 -polytope in the Euclidean 4 -space is constructed. These two polytopes show th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c349bf11d626166b898e7e876bf48f68
https://doi.org/10.26493/1855-3974.1055.0f4
https://doi.org/10.26493/1855-3974.1055.0f4
Publikováno v:
Operations Research. 64:1466-1481
A k-club is a subset of vertices of a graph that induces a subgraph of diameter at most k, where k is a positive integer. By definition, 1-clubs are cliques and the model is a distance-based relaxation of the clique definition for larger values of k.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11dfc039dbf2dffd1dfbadf140e22bc8
https://doi.org/10.1287/opre.2016.1500
https://doi.org/10.1287/opre.2016.1500