Submodular + Supermodular function maximization with knapsack constraint

We investigate a class of non-submodular function optimization problems, specifically maximizing the sum of a normalized monotone submodular function f and a normalized monotone supermodular function g under a knapsack constraint. By utilizing the total curvature κf of f and the supermodular curvatu...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 377; pp. 113 - 133
Main Authors:	Shi, Majun, Yang, Zishen, Wang, Wei
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.12.2025
Subjects:	Greedy algorithm Iterated submodular+modular procedure Sandwich method Submodular function Supermodular function Greedy algorithm Submodular function Iterated submodular+modular procedure Supermodular function Sandwich method
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!