๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Concave minimization over a convex polyhedron

โœ Scribed by Hamdy A. Taha

Publisher
John Wiley and Sons
Year
1973
Tongue
English
Weight
781 KB
Volume
20
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for concave integer minimiz
An algorithm for concave integer minimization over a polyhedron
โœ Harold P. Benson; S. Selcuk Erenguc ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 753 KB

We present an algorithm for solving the problem of globally minimizing a concave function over the integers contained in a compact polyhedron. The objective function of this problem need not be separable or even analytically defined. To our knowledge, the algorithm is the first ever proposed for thi

On the section of a convex polyhedron
On the section of a convex polyhedron
โœ Peter Frankl; Hiroshi Maehara; Junichiro Nakashima ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB

Let P be a convex polyhedron in R s, and E be a plane cutting P. Then the section Pt=Pc~E is a convex polygon. We show a sharp inequality (the perimeter of Pe) <~ L(P), where L(P) denotes the sum of the edge-lengths of P. For a polyhedron (or a polygon) X, L(X) denotes the sum of the edge-lengths o