Results 291 to 300 of about 76,388 (315)
Polymorphism and magnetism in a Kitaev honeycomb cobaltate KCoAsO4. [PDF]
Sci RepHaraguchi Y, Nishio-Hamane D, Katori HA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Pivoting in an Outcome Polyhedron
Journal of Global Optimization, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harold P. Benson, Erjiang Sun
openaire +2 more sources
, 1985 For extreme points \(\hat x\) of the polyhedra \(\{\) \(x|\) \(Ax=b\), \(x\geq 0\}\), the computation of incident faces is easy if \(\hat x\) is nondegenerate. In the degenerate case there are some pitfalls. The paper provides examples and surveys results on faces incident at a degenerate extreme point. With respect to multiobjective linear programming
openaire +2 more sources
On the multiway cut polyhedron
Networks, 1991AbstractGiven a graph G = (V,E) and a set N ⊆ V, we consider the problem of finding a minimum‐weight multiway cut that separates each pair of nodes in N. In this paper we give an integer programming formulation of this problem and study the associated polyhedron. We give some computational results to support the strength of our facets.
M. R. Rao, Sunil Chopra
openaire +3 more sources
Polyhedrons and Quasi-polyhedrons
2015In elementary geometry, a polyhedron (plural polyhedra or polyhedrons) is a body in three dimensions with flat faces, straight edges and sharp corners or vertices. The word “polyhedron” comes from the Classical Greek as poly- (“many”) and -hedron (form of “base” or “seat”).
S. N. Krivoshapko, V. N. Ivanov
openaire +2 more sources
Canadian Journal of Mathematics, 1983
1. Introduction. Let P be a polyhedron (i.e., a 3-dimensional polytope). A path in P is defined as a sequence of edges (x1, x2), …, (xi−1, xi), (xi, xi−1), …, (xn−1, xn) where (xi, xi+1) denotes the edge with endpoints Xi and Xi+1. Define the length |A| of a path A to be the number of edges of said path. The distance between any two vertices x and y of
openaire +2 more sources
1. Introduction. Let P be a polyhedron (i.e., a 3-dimensional polytope). A path in P is defined as a sequence of edges (x1, x2), …, (xi−1, xi), (xi, xi−1), …, (xn−1, xn) where (xi, xi+1) denotes the edge with endpoints Xi and Xi+1. Define the length |A| of a path A to be the number of edges of said path. The distance between any two vertices x and y of
openaire +2 more sources
POLYHEDRON DISTORTIONS IN TOURMALINE
The Canadian Mineralogist, 2002Distortion parameters [?, s2, DI(Y-O), DI(O-Y-O), DI(O-O)] have been calculated for cation polyhedra in tourmalines of different chemical compositions. Tourmalines with greater amounts of small, highly charged ions in the YO6 octahedron display greater bond-length distortion in Y. The size and charge of the occupants at the Y site have been included in
Franklin F. Foit +6 more
openaire +3 more sources
On antipodes on a convex polyhedron
advg, 2005Abstract We define an antipode of a point p as a farthest point from p. In this paper we describe, on the surface of a convex polyhedron endowed with its intrinsic metric, points admitting at least two antipodes.
openaire +3 more sources
Adjacency on the Postman Polyhedron
SIAM Journal on Algebraic Discrete Methods, 1981Let $G = (V,E)$ be a loopless, undirected graph and $C \subseteq V$ have even cardinality. A postman set is a subset $J \subseteq E$ such that for every node $v \in V$, the number of edges of J incident to v is odd if and only if $v \in C$. The postman polyhedron$P( G )$ is the sum of the convex hull of all incidence vectors of postman sets and the ...
openaire +2 more sources