Results 301 to 310 of about 76,388 (315)

Decomposing the boundary of a nonconvex polyhedron

Algorithmica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernard Chazelle, Leonidas Palios
openaire   +4 more sources

On the spanning tree polyhedron

Operations Research Letters, 1989
Given an arbitrary simple finite graph, we can define the convex hull of the incidence vectors of all spanning trees. The paper gives an alternative proof of a theorem of Fulkerson, which gives an inequality representation of the above-defined polyhedron. The proof depends on an easy spanning-tree algorithm applied to the original graph.
openaire   +2 more sources

The volume of a lattice polyhedron

Mathematical Proceedings of the Cambridge Philosophical Society, 1963
Let L be the lattice of all points with integer coordinates in the real affine plane R2 (with respect to some fixed coordinate system). Let X be a finite rectilinear simplicial complex in R2 whose 0-simplexes are points of L. Suppose X is pure and the frontier Ẋ of X is a Jordan curve; then there is a well-known formula for the area of X in terms of ...
openaire   +3 more sources

Supporting cone of a polyhedron

Journal of Soviet Mathematics, 1989
See the review in Zbl 0463.46015.
openaire   +3 more sources

The Continuous Mixing Polyhedron

Mathematics of Operations Research, 2005
We analyze the polyhedral structure of the sets PCMIX = {(s, r, z) ∈ R × R+n × Zn ∣ s + rj + zj ≥ fj, j = 1, …, n} and P+CMIX = PCMIX ∩ {s ≥ 0}. The set P+CMIX is a natural generalization of the mixing set studied by Pochet and Wolsey [15, 16] and Günlük and Pochet [8] and recently has been introduced by Miller and Wolsey [12].
openaire   +2 more sources

Stereology for some classes of polyhedrons

Advances in Applied Probability, 1995
A general method for solving stereological problems for particle systems is applied to polyhedron structures. We suggested computing the kernel function of the respective stereological integral equation by means of computer simulation. Two models of random polyhedrons are investigated.
J. Ohser, F. Mücklich
openaire   +3 more sources

AN EXPOSITION OF POINCARÉ'S POLYHEDRON THEOREM

1994
Poincaré's Theorem is an important, widely used and well-known result. There is a number of expositions in the literature; however, there is no source which contains a completely satisfying proof that applies to all dimensions and all constant curvature geometries.
D. B. A. Epstein, PETRONIO, CARLO
openaire   +3 more sources

The K-Walk Polyhedron

1994
Given a directed graph G = (V, E), with distinguished nodes s and t, a k-walk from s to t is a walk with exactly k arcs. In this paper we consider polyhedral aspects of the problem of finding a minimum-weight k-walk from s to t. We describe an extended linear programming formulation, in which the number of inequalities and variables is polynomial in ...
A. Bruce Gamble, Collette R. Coullard, Jin Liu   +2 more
openaire   +2 more sources

Admissible points of a convex polyhedron

Journal of Optimization Theory and Applications, 1982
In this paper, we present several new properties of the admissible points of a convex polyhedron. These properties can be classified into two categories. One category concerns the characterization and generation of these points. The other category concerns the circumstances under which these points are efficient solutions for linear multiple-objective ...
openaire   +2 more sources

The Maximal Distance in a Polyhedron

1988
The question how to find two points in a bounded polyhedron X for which the euclidean distance is maximal leads to the following nonlinear programming (NLP) problem $$\max \{ {\left\| {x{\mkern 1mu} - {\mkern 1mu} y} \right\|^2}{\mkern 1mu} = {\mkern 1mu} {x^T}x{\mkern 1mu} + {y^T}y{\mkern 1mu} - {\mkern 1mu} 2{x^T}y|{\mkern 1mu} x{\mkern 1mu} \in {
openaire   +2 more sources