Constraint generation approaches for submodular function maximization leveraging graph properties
From MaRDI portal
Publication:6154401
Recommendations
- An efficient branch-and-cut algorithm for submodular function maximization
- Techniques for submodular maximization
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Maximization of submodular functions: theory and enumeration algorithms
- Non-submodular maximization with matroid and knapsack constraints
Cites work
- scientific article; zbMATH DE number 1175945 (Why is no real title available?)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint
- An analysis of approximations for maximizing submodular set functions—I
- An efficient branch-and-cut algorithm for submodular function maximization
- An improved branch \& bound method for the uncapacitated competitive location problem
- Maximization of submodular functions: theory and enumeration algorithms
- Maximizing Non-monotone Submodular Functions
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
This page was built for publication: Constraint generation approaches for submodular function maximization leveraging graph properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154401)
