C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Maximizing the Sum of a Supermodular Function and a Monotone DR-submodular Function Subject to a Knapsack Constraint on the Integer Lattice.
Jingjing Tan
Yicheng Xu
Dongmei Zhang
Xiaoqing Zhang
Published in:
CSoNet (2021)
Keyphrases
</>
submodular functions
combinatorial optimization
greedy algorithm
upper bound
facility location problem
objective function
knapsack problem
energy function
integer variables
dynamic programming
branch and bound algorithm
computer vision
pairwise
convex optimization
integer points