Archive-based Single-Objective Evolutionary Algorithms for Submodular Optimization [PDF]
Constrained submodular optimization problems play a key role in the area of combinatorial optimization as they capture many NP-hard optimization problems.
Neumann, Frank, Rudolph, Günter
core +1 more source
Optimal Submodular Extensions for Marginal Estimation.
Submodular extensions of an energy function can be used to efficiently compute approximate marginals via variational inference. The accuracy of the marginals depends crucially on the quality of the submodular extension. To identify the best possible extension, we show an equivalence between the submodular extensions of the energy and the objective ...
Pansari, P, Russell, C, Mudigonda, P
openaire +2 more sources
Bi-submodular Optimization (BSMO) for Detecting Drug-Drug Interactions (DDIs) from On-line Health Forums. [PDF]
Hu Y, Wang R, Chen F.
europepmc +1 more source
Expected Maximization of a Concave Utility Function Under Threshold-Based Activation
Maximizing the expected value of a concave and strictly increasing utility function defines a fundamental class of discrete optimization problems. Among them, coverage decision problems with diminishing marginal returns under uncertainty, typically ...
Guangming Li +4 more
doaj +1 more source
Influential Billboard Slot Selection Using Spatial Clustering and Pruned Submodularity Graph
Billboard Advertisement is a popular out-of-home advertising technique adopted by commercial houses. Companies own billboards and offer them to commercial houses on a payment basis.
Dildar Ali +2 more
doaj +1 more source
Algorithms for Optimizing the Ratio of Submodular Functions
We investigate a new optimization problem involving minimizing the Ratio of two Submodular (RS) functions. We argue that this problem occurs naturally in several real world applications.
Rishabh Iyer +3 more
core
Choosing panels of genomics assays using submodular optimization. [PDF]
Wei K +3 more
europepmc +1 more source
Submodular Order Functions and Assortment Optimization
We define a new class of set functions that, in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order. This class of functions includes monotone submodular functions as a subfamily.
openaire +4 more sources
Combinatorial Algorithms for Submodular Function Minimization and Related Problems [PDF]
Submodular functions are common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizes the classical minimum cut problem and also contains a ...
Price, Christopher
core
Optimization of Submodular Functions: Relaxations and Algorithms
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodularity, March 19-22, 2012.Runtime: 40:41 minutes.In this lecture, we cover the basic variants of optimization problems involving submodular functions, and ...
Vondrak, Jan
core

