Constrained submodular maximization via greedy local search.
Kanthi K. SarpatwarBaruch SchieberHadas ShachnaiPublished in: Oper. Res. Lett. (2019)
Keyphrases
- greedy algorithm
- search algorithm
- objective function
- search space
- hill climbing
- greedy search
- greedy algorithms
- genetic algorithm
- greedy strategy
- dynamic programming
- worst case
- simulated annealing
- hard constraints
- greedy heuristic
- global search
- marginal utility
- memetic algorithm
- constrained multi objective optimization problems
- knapsack problem
- tabu search
- feature selection
- search procedure
- energy minimization
- search strategies
- combinatorial optimization
- special case
- systematic search
- lower bound
- machine learning