Relaxation heuristics for the set covering problem

Journal of the Operations Research Society of Japan

Volumn 50, Issue 4, 2007, Pages 350-375

  Umetani, Shunji ^a   Yagiura, Mutsunori ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b NAGOYA UNIVERSITY   (Japan)

Author keywords

Combinatorial optimization; Heuristic algorithm; Lagrangian relaxation; Linear programming; Set covering problem; Subgradient method

Indexed keywords

EID: 39649099763     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.50.350     Document Type: Article

References (53)

1. A. Agrawal, P. Klein, and R. Ravi: When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24 (1995), 440-456.
2. K.S. Al-Sultan, M.F. Hussain, and J.S. Nizami: A genetic algorithm for the set covering problem. Journal of the Operational Research Society, 47 (1996), 702-709.
3. E. Balas and M.C. Carrera: A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research, 44 (1996), 875-890.
4. E. Balas and A. Ho: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study. Mathematical Programming, 12 (1980), 37-60.
5. E. Balas and W. Padberg: Set partitioning: A survey. SIAM Review, 18 (1976), 710-761.
6. R. Bar-Yehuda and S. Even: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2 (1981), 198-203.
7. J.E. Beasley: An algorithm for set covering problem. European Journal of Operational Research, 31 (1987), 85-93.
8. J.E. Beasley: A Lagrangian heuristic for set-covering problems. Naval Research Logistics, 37 (1990), 151-164.
9. J.E. Beasley: OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41 (1990), 1069-1072.
10. J.E. Beasley: Lagrangean relaxation. In C.R. Reeves (ed.): Modern Heuristic Techniques for Combinatorial Problems (Blackwell Scientific Publications, 1993), 243-303.
11. J.E. Beasley and P.C. Chu: A genetic algorithm for the set covering problem. European Journal of Operational Research, 94 (1996), 392-404.
12. J.E. Beasley and K. Jørnsten: Enhancing an algorithm for set covering problems. European Journal of Operational Research, 58 (1992), 293-300.
13. D.P. Bertsekas: Nonlinear Programming (Athena Scientific, 1995).
14. R.E. Bixby: Solving real-world linear programs: A decade and more of progress. Operations Research, 50 (2002), 3-15.
15. R.E. Bixby, J.W. Gregory, I.J. Lustig, R.E. Marsten, and D.F. Shanno: Very large-scale linear programming: A case study in combining interior point and simplex methods. Operations Research, 40 (1992), 885-897.
16. J. Borneman, M. Chrobak, G.D. Vedova, A. Figueroa, and T. Jiang: Probe selection algorithms with applications in the analysis of microbial communities. Bioinformatics, 17 (2001), S39-S48.
17. E. Boros, P.L. Hammer, T. Ibaraki, and A. Kogan: Logical analysis of numerical data. Mathematical Programming, 79 (1997), 163-190.
18. M.J. Brusco, L.W. Jacobs, and G.M. Thompson: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems. Annals of Operations Research, 86 (1999), 611-627.
19. C.Y. Byun: Lower bounds for large-scale set partitioning problems. ZIB-Report, 01-06 (Zuse Institute Berlin, 2001).
20. A. Caprara, M. Fischetti, and P. Toth: A heuristic method for the set covering problem. Operations Research, 47 (1999), 730-743.
21. A. Caprara, P. Toth, and M. Fischetti: Algorithms for the set covering problem. Annals of Operations Research, 98 (2000), 353-371.
22. M. Caserta: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In K.F. Doerner, M. Gendreau, P. Greistorfer, W.J. Gutjahr, R.F. Hartl, and M. Reimann (eds.): Metaheuristics: Progress in Complex Systems Optimization (Springer, 2007), 43-63.
23. S. Ceria, P. Nobili, and A. Sassano: Set covering problem. In M. Dell'Amico, F. Maffioli and S. Martello (eds.): Annotated Bibliographies in Combinatorial Optimization (John Wiley & Sons, 1997), 415-428.
24. S. Ceria, P. Nobili, and A. Sassano: A Lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming, 81 (1998), 215-228.
25. V. Chvátal: A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4 (1979), 233-235.
26. J.J. Dongarra: Performance of various computers using standard linear equations software. Technical Report, CS89-85 (Computer Science Department, University of Tennessee, 2005).
27. U. Feige: A threshold of In n for approximating set cover. Journal of the ACM, 45 (1998), 634-652.
28. A. Feo and M.G.C. Resende: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8 (1989), 67-71.
29. M.L. Fisher: The Lagrangian relaxation method for solving integer programming problems. Management Science, 27 (1981), 1-18.
30. M.L. Fisher and P. Kedia: Optimal solution of set covering/partitioning problems using dual heuristics. Management Science, 36 (1990), 674-688.
31. M.R. Garey and D.S. Johnson: Computers and Intractability - A Guide to the Theory of NP-Completeness (W. H. Freeman and Company, 1979).
32. R.S. Garfinkel and G.L. Nemhauser: Integer Programming (John Wiley & Sons, 1972).
33. A.M. Geoffrion: Lagrangian relaxation for integer programming. Mathematical Programming Study, 2 (1974), 82-114.
34. M.X. Goemans and D.P. Williamson: A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24 (1995), 296-317.
35. M.X. Goemans and D.P. Williamson: The primal-dual method for approximation algorithms and its application to network design problems. In D.S. Hochbaum (ed.): Approximation Algorithms for NP-hard Problems (International Thomson Publishing, 1997), 144-191.
36. F.C. Gomes, C.N. Meneses, P.M. Pardalos, and G.V.R. Viana: Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Computers and Operations Research, 33 (2006), 3520-3534.
37. T. Grossman and A. Wool: Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research, 101 (1997), 81-92.
38. S. Haddadi: Simple Lagrangian heuristic for the set covering problem. European Journal of Operational Research, 97 (1997), 200-204.
39. M. Held and R.M. Karp: The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1 (1971), 6-25.
40. A.C. Ho: Worst case analysis of a class of set covering heuristics. Mathematical Programming, 23 (1982), 170-180.
41. D.S. Hochbaum: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, 11 (1982), 555-556.
42. D.S. Hochbaum: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. D.S. Hochbaum (ed.): Approximation Algorithms for NP-hard Problems (International Thomson Publishing, 1997), 94-143.
43. K.L. Hoffman and M. Padberg: Solving airline crew scheduling problems by branch-and-cut. Management Science, 39 (1993), 657-682.
44. L.W. Jacobs and M.J. Brusco: Note: A local-search heuristics for large set-covering problems. Naval Research Logistics, 42 (1995), 1129-1140.
45. L.A.N. Lorena and F.B. Lopes: A surrogate heuristic for set covering problems. European Journal of Operational Research, 79 (1994), 138-150.
46. L. Trevisan: Non-approximatability results for optimization problems on bounded degree instances. Proceedings of the 33rd annual ACM symposium on Theory of computing (2001), 453-461.
47. F.J. Vasko and G.R. Wilson: An efficient heuristics for large set covering problems. Naval Research Logistics Quarterly, 31 (1984), 163-171.
48. V.V. Vazirani: Approximation algorithms (Springer, 2001).
49. D. Wedelin: An algorithm for large scale 0-1 integer programming with application to airline crew scheduling. Annals of Operations Research, 57 (1995), 283-301.
50. M. Yagiura, M. Kishida, and T. Ibaraki: A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research, 172 (2006), 472-499.
51. ILOG: CPLEX. http://www.ilog.com/.
52. A. Makhorin: GLPK (GNU Linear Programming Kit). http://www.gnu.org/ software/glpk/.
53. SPEC (Standard Performance Evaluation Corporation). http://www.spec.org/.