Non-submodular maximization with matroid and knapsack constraints
From MaRDI portal
(Redirected from Non-submodular maximization with matroid and knapsack constraints)
Recommendations
- Non-monotone submodular maximization under matroid and knapsack constraints
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Constrained submodular maximization via greedy local search
- Maximizing a monotone non-submodular function under a knapsack constraint
- On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
Cites work
- A Multiple Exchange Property for Bases
- A note on maximizing a submodular set function subject to a knapsack constraint
- An exchange theorem for bases of matroids
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Constrained submodular maximization via greedy local search
- Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
- Fast algorithms for maximizing submodular functions
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
- Packing of arborescences with matroid constraints via matroid intersection
- Parallelizing greedy for submodular set function maximization in matroids and beyond
- Parametric monotone function maximization with matroid constraints
- Submodular maximization over multiple matroids via generalized exchange properties
- Submodular maximization with uncertain knapsack capacity
Cited in
(18)- Multi-constrained matroidal knapsack problems
- An adaptive algorithm for maximization of non-submodular function with a matroid constraint
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Maximizing a monotone non-submodular function under a knapsack constraint
- Maximize a monotone function with a generic submodularity ratio
- Maximization of constrained non-submodular functions
- Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications
- On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Non-monotone submodular maximization under matroid and knapsack constraints
- Improved algorithms for non-submodular function maximization problem
- Maximization of nonsubmodular functions under multiple constraints with applications
- Constraint generation approaches for submodular function maximization leveraging graph properties
- Regularized nonmonotone submodular maximization
- Greedy is good: constrained non-submodular function maximization via weak submodularity
- Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
This page was built for publication: Non-submodular maximization with matroid and knapsack constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024472)
