Maximizing a monotone non-submodular function under a knapsack constraint
From MaRDI portal
Publication:2156291
DOI10.1007/s10878-020-00620-1zbMath1495.90169MaRDI QIDQ2156291
Yishui Wang, Bin Liu, Dongmei Zhang, Zhenning Zhang, Da-Chuan Xu
Publication date: 18 July 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00620-1
90C27: Combinatorial optimization
Cites Work
- Unnamed Item
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- A note on maximizing a submodular set function subject to a knapsack constraint
- Bayesian experimental design: A review
- Maximizing monotone submodular functions over the integer lattice
- Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- An analysis of approximations for maximizing submodular set functions—I
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature