-Set Cover Using Factor-Revealing Linear Programs.
Stavros AthanassopoulosIoannis CaragiannisChristos KaklamanisPublished in: Theory Comput. Syst. (2009)
Keyphrases
- linear program
- set cover
- np hard
- primal dual
- linear programming
- greedy algorithm
- approximation algorithms
- network flow
- greedy heuristics
- semi infinite
- simplex method
- stochastic programming
- optimal solution
- linear programming problems
- dynamic programming
- column generation
- objective function
- greedy heuristic
- convex hull
- special case
- interior point methods
- solution space
- simplex algorithm
- scheduling problem
- linear inequalities
- np complete
- mixed integer
- nelder mead
- integer program
- extreme points
- lower bound
- minimum cost
- integer programming
- worst case
- interior point
- market equilibrium
- low discrepancy sequences
- data mining
- frequent itemset mining
- simulated annealing
- machine learning