Set Covering by an All Integer Algorithm: Computational Experience.
Harvey M. SalkinRonald D. KoncalPublished in: J. ACM (1973)
Keyphrases
- set covering
- set covering problem
- detection algorithm
- np hard
- dynamic programming
- worst case
- experimental evaluation
- computational complexity
- optimal solution
- computational cost
- learning algorithm
- matching algorithm
- cost function
- probabilistic model
- benchmark problems
- preprocessing
- segmentation algorithm
- optimization algorithm
- linear programming
- times faster
- np complete
- simulated annealing
- high accuracy
- state space
- evolutionary algorithm
- multi objective