Non-Submodular Maximization with Matroid and Knapsack Constraints
From MaRDI portal
Publication:5024472
DOI10.1142/S0217595921400017zbMath1484.90120OpenAlexW3125922185MaRDI QIDQ5024472
Xianzhao Zhang, Yanjun Jiang, Dong-lei Du, Yi-Jing Wang
Publication date: 1 February 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921400017
Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- A note on maximizing a submodular set function subject to a knapsack constraint
- Parametric monotone function maximization with matroid constraints
- Packing of arborescences with matroid constraints via matroid intersection
- An exchange theorem for bases of matroids
- Constrained submodular maximization via greedy local search
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- Submodular Maximization with Uncertain Knapsack Capacity
- Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint
- Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
- Fast algorithms for maximizing submodular functions
- A Multiple Exchange Property for Bases
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
This page was built for publication: Non-Submodular Maximization with Matroid and Knapsack Constraints
