Submodular Function Minimization under a Submodular Set Covering Constraint.
Naoyuki KamiyamaPublished in: TAMC (2011)
Keyphrases
- submodular functions
- set covering
- greedy algorithm
- objective function
- facility location problem
- set covering problem
- energy function
- integer programming
- combinatorial optimization
- column generation
- facility location
- convex optimization
- multi objective
- lower bound
- branch and bound
- learning problems
- combinatorial auctions
- branch and bound algorithm
- linear program
- integer program
- optimization problems
- denoising
- dynamic programming
- cost function
- pairwise
- crew pairing
- hypergraph model