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

The unconditional minimization of non-convex functions

โœ Scribed by V.A. Bereznev; V.G. Karmanov; A.A. Tret'yakov

Publisher
Elsevier Science
Year
1987
Weight
286 KB
Volume
27
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Convexity of minimal dominating function
Convexity of minimal dominating functions of trees โ€” II
โœ E.J. Cockayne; G. MacGillivray; C.M. Mynhardt ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 580 KB

The relation Ye on the set of minimal dominating functions (MDFs) of a finite graph G is defined by f&?g if and only if any convex combination off and g is also an MDF. If fis a nonintegral MDF of a tree, the existence of another MDF with fewer nonintegral values and other desirable properties is es

Convexity of minimal total dominating fu
Convexity of minimal total dominating functions in graphs
โœ Yu, Bo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 122 KB ๐Ÿ‘ 2 views

A total dominating function (TDF) of a graph G = (V, E) is a function f : V โ†’ [0, 1] such that for each v โˆˆ V , the sum of f values over the open neighbourhood of v is at least one. Zero-one valued TDFs are precisely the characteristic functions of total dominating sets of G. We study the convexity