Local search algorithm for unicost set covering problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4031 LNAI, Issue , 2006, Pages 302-311

  Musliu, Nysret ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

FITNESS FUNCTION; LOCAL SEARCH ALGORITHM; UNICOST SET COVERING PROBLEM;

SET THEORY;

EID: 33746215665     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779568_34     Document Type: Conference Paper

References (15)

1. E. Balas and A. Ho. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Mathematical Programming, 12:37-60, 1980.
2. J. E. Beasley. An algorithm for set covering problems. European Journal of Operational Research, 31:86-93, 1987.
3. J. E. Beasley. A lagrangian heuristic for set covering problems. Naval Research Logistics, 37:151-164, 1990.
4. J. E. Beasley and P. C. Chu. A genetic algorithm for set covering problem. European Journal of Operational Research, 94:392-404, 1996.
5. H. L. Bodlaender. Discovering treewidth. In In P. Vojtás, M. Bieliková, B. Charron-Bost, and O. Sýkora, editors, SOFSEM 2005: Theory and Practice of Computer Science, pages 116. Springer, Lecture Notes in Computer Science, vol. 3381, 2005.
6. V. Chvátal. A greedy heuristic for the set-covering problem. Math. of Oper. Res., 4/3:233-235, 1979.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, editors. Introduction to Algorithms, 2nd ed. The MIT Press, Massachusetts, 2001.
8. D.R. Fulkerson, G.L. Nemhauser, and L.E. Trotter. Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of steiner triple systems. Mathematical Programming Study, 2:72-81, 1974.
9. Fred Glover and Manuel Laguna. Tabu search. Kluwer Academic Publishers, 1997.
10. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural csp decomposition methods. Artificial Intelligence, 124(2):243-282, 2000.
11. T. Grossman and A. Wool. Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research, 101:81-92, 1997.
12. G. Kinney, J.W. Barnes, and B. Colleti. A group theoretic tabu search algorithm for set covering problems. Working paper, available from http://www.me.utexas.edu/barnes/research/, 2004.
13. Elena Marchiori and Adri Steenbeek. An iterated heuristic algorithm for the set covering problem. Proceedings of WEA'98, Germany, 1998.
14. K. Nonobe and T. Ibaraki. A tabu search approach to the constraint satisfaction problem as a general problem solver. European Journal of Operational Research, 106:599-623, 1998.
15. M.A. Odijk and H. van Maaren. Imporved solutions for the steiner triple covering problems. Technical Report, TU Delft University, 11, 1996, 1996.