Submodular set functions and monotone systems in aggregation problems. II (Q1107450): Difference between revisions

[For part I see Autom. Remote Control 48, No.5, 679-689 (1987; Zbl 0639.90077).] The relationship from part I between submodular functions and functions determining the extremal properties of monotone sytems is applied to prove that, on the chain of any set-theoretical interval, the submodular function varies more slowly than the linear function of the cardinality of ordered sets. Branch-and-bound algorithms are developed for unconstrained and constrained optimization with optimal tree traversal. Some standard examples and aggregation of empirical data are solved by applying the apparatus of combinatorial optimization of submodular functions.