✦ LIBER ✦

Separating transformation of domains and extremal partition problems

✍ Scribed by V. N. Dubinin

Publisher: Springer US
Year: 1991
Tongue: English
Weight: 816 KB
Volume: 53
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01303649

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Problem of extremal partition for n-fold

Problem of extremal partition for n-fold connected domains

✍ G. V. Kuz'mina 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 588 KB

Partitioning the parameter domain in a C

Partitioning the parameter domain in a Chebyshev extremal problem

✍ L. S. Stoikova 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 512 KB

An extremal problem on partition of numb

An extremal problem on partition of numbers

✍ B. I. Baranov 📂 Article 📅 1981 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 185 KB

The problem of extremal partition of the

The problem of extremal partition of the Riemann sphere

✍ G. V. Kuz'mina 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 808 KB

Disjunctive optimization, max-separable

Disjunctive optimization, max-separable problems and extremal algebras

✍ Karel Zimmermann 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 127 KB

The paper was motivated by solution methods suggested in the literature for solving linear optimization problems over (max; +)-or (max; min)-algebras and certain class of so called max-separable optimization problems. General features of these optimization problems, which play a crucial role in the

Digraph extremal problems, hypergraph ex

Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures

✍ W.G Brown; M Simonovits 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 747 KB

We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o