Submodular set functions and monotone systems in aggregation problems. II
[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.
- Maximization of submodular functions: theory and enumeration algorithms
- Submodular set functions and monotone systems in aggregation problems. I
- Extremal problems on finite sets with a monotone measure
- A variation of DS decomposition in set function optimization
- Submodularity and its application to some global constraints
- scientific article; zbMATH DE number 2111622 (Why is no real title available?)
- On the submodularity of the profit function in a problem of transport planning
- Using atomic bounds to get sub-modular approximations
- Maximization of generalized characteristics of functions of monotone systems
This page was built for publication: Submodular set functions and monotone systems in aggregation problems. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107450)
