Results 201 to 210 of about 13,098 (239)
Some of the next articles are maybe not open access.

Submodular function minimization

Mathematical Programming, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Submodular Functions Maximization Problems

2018
This chapter focuses on maximizing a special class of functions called submodular functions under various combinatorial constraints. It deals with algorithms maximizing submodular functions subject to combinatorial constraints. The chapter discusses basic discrete algorithms for maximizing submodular functions subject to various constraints.
Niv Buchbinder, Moran Feldman
openaire   +1 more source

Decomposition of submodular functions

Combinatorica, 1983
A decomposition theory for submodular functions is described. Any such function is shown to have a unique decomposition consisting of indecomposable functions and certain highly decomposable functions, and the latter are completely characterized. Applications include decompositions of hypergraphs based on edge and vertex connectivity, the decomposition
openaire   +1 more source

M-fuzzifying submodular functions

Journal of Intelligent & Fuzzy Systems, 2014
In this paper, the concept of M-fuzzifying submodular functions is introduced, which is a generalization of submodular functions in matroid theory. It is shown that M-fuzzifying matroids can be generated from an M-fuzzifying submodular function in different ways.
Xiu, Zhen-Yu, Shi, Fu-Gui
openaire   +1 more source

On submodular function minimization

Combinatorica, 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Submodular Functions and Matroids

2015
This chapter presents definitions, relevant properties, and examples of submodular functions, which will be built on in subsequent sections. Techniques for constructing submodular functions and proving submodularity are described. The concept of a matroid, which generalizes the concept of matrix rank, is introduced. The matroid rank, basis, and closure
Andrew Clark   +3 more
openaire   +1 more source

Minimizing symmetric submodular functions

Mathematical Programming, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce   +2 more
exaly  

Chapter 9 Submodular Functions

1997
Publisher Summary In combinatorial mathematics, submodular functions are a relatively recent phenomenon. Submodular functions can be regarded as a generalization of matroid rank functions. The study of basic subinodular operations, such as convolution and Dilworth truncation is significant for practical algorithm designers because in addition to ...
openaire   +1 more source

Submodular functions and convexity

1983
In “continuous” optimization convex functions play a central role. Besides elementary tools like differentiation, various methods for finding the minimum of a convex function constitute the main body of nonlinear optimization. But even linear programming may be viewed as the optimization of very special (linear) objective functions over very special ...
openaire   +1 more source

Home - About - Disclaimer - Privacy