Submodular Function Minimization with Submodular Set Covering Constraints and Precedence Constraints.
Naoyuki KamiyamaPublished in: WAOA (2017)
Keyphrases
- precedence constraints
- submodular functions
- set covering
- branch and bound algorithm
- set covering problem
- greedy algorithm
- combinatorial optimization
- facility location problem
- approximation algorithms
- scheduling problem
- objective function
- global constraints
- energy function
- parallel machines
- branch and bound
- integer programming
- lower bound
- combinatorial auctions
- np hard
- partially ordered
- column generation
- partial order
- constraint satisfaction
- lagrangian relaxation
- integer program
- hypergraph model
- convex optimization
- constraint programming
- optimization problems
- simulated annealing
- optimal solution
- cost function