A Complete Solution to the Set Covering Problem

@inproceedings{Yang2015ACS,
  title={A Complete Solution to the Set Covering Problem},
  author={Qi Yang and Adam Nofsinger and Jamie McPeek and Joel Phinney and Ryan Knuesel},
  year={2015}
}
The set-covering problem is a classical problem in computational complexity theory. It has been proved to be NP hard and different heuristic algorithms have been presented to solve the problem. We have developed a new algorithm and optimized the input process. We will provide analysis and show that the complexity of our algorithm is better than that of earlier solutions in most cases. Our experiments show that our new solution performs significantly better than earlier solutions and provides a… CONTINUE READING
2 Citations
9 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Improving the Input Operation for the Set-Covering Problem

  • J. Phinney, R. Knuesel, Q. Yang
  • The Midwest Instructional and Computing Symposium…
  • 2010
2 Excerpts

Algorithmic construction of sets for krestrictions " , ACM Trans

  • Noga Alon
  • Algorithms ( ACM )
  • 1991

Set Partitioning: A Survey

  • E. Balas, M. W. Padberg
  • SIAM Review,
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…