Results 131 to 140 of about 1,516 (207)

Archive-based Single-Objective Evolutionary Algorithms for Submodular Optimization [PDF]

open access: yes
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

Choosing panels of genomics assays using submodular optimization. [PDF]

open access: yesGenome Biol, 2016
Wei K   +3 more
europepmc   +1 more source

Submodular Order Functions and Assortment Optimization

open access: yesManagement Science
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   +3 more sources

Ranking with submodular functions on a budget. [PDF]

open access: yesData Min Knowl Discov, 2022
Zhang G, Tatti N, Gionis A.
europepmc   +1 more source

Zeroth-order Stochastic Approximation Algorithms for DR-submodular Optimization [PDF]

open access: yes
In this paper, we study approximation algorithms for several classes of DR-submodular optimization problems, where DR is short for diminishing return. Following a newly introduced algorithm framework for zeroth-order stochastic approximation methods, we ...
Xu, Dachuan   +3 more
core  

The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]

open access: yesTheory Comput Syst
van Heuven van Staereling I   +2 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy