An exact solver for submodular knapsack problems
From MaRDI portal
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A threshold of ln n for approximating set cover
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- An efficient branch-and-cut algorithm for submodular function maximization
- Constraint generation approaches for submodular function maximization leveraging graph properties
- Distributed submodular maximization
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 5968956 (Why is no real title available?)
- scientific article; zbMATH DE number 3580314 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Practical budgeted submodular maximization
- Tight approximation algorithms for maximum general assignment problems
- Tight approximation algorithms for maximum separable assignment problems
This page was built for publication: An exact solver for submodular knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7240106)
