A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice

We consider a knapsack-constrained maximization problem of a nonnegative monotone DR-submodular function f over a bounded integer lattice [ B ] in R + n , max { f ( x ) : x ∈ [ B ] and ∑ i = 1 n x ( i ) c ( i ) ≤ 1 } , where n is the cardinality of a ground set N and c ( · ) is a cost function defin...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 85; no. 1; pp. 15 - 38
Main Authors:	Gong, Suning, Nong, Qingqin, Bao, Shuyu, Fang, Qizhi, Du, Ding-Zhu
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2023 Springer Springer Nature B.V
Subjects:	Algorithms Approximation Computer Science Cost function Enumeration Greedy algorithms Integers Mathematical analysis Mathematics Mathematics and Statistics Maximization Operations Research/Decision Theory Optimization Real Functions Run time (computers) 68W40 DR-submodular maximization Integer lattice Approximation Algorithm 90C27 68W25 Knapsack constraint
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!