Simple Lagrangian heuristic for the set covering problem

European Journal of Operational Research

Volumn 97, Issue 1, 1997, Pages 200-204

  Haddadi, Salim ^a  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Greedy heuristic; Lagrangian duality; Redundant cover; Subgradient optimization

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY;

LAGRANGIAN HEURISTIC; SET COVERING PROBLEM; SUBGRADIENT OPTIMIZATION;

HEURISTIC METHODS;

EID: 0031076486     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00050-1     Document Type: Article

References (13)

1. Baker, E.K., Bodin, L.D., Finnegan, W.F., and Ponder, R.J., "Efficient heuristic solutions to an airline crew scheduling problem", AIIE Transactions (1979) 79-85.
2. Beasley, J.E., "An algorithm for set covering problems", European Journal of Operational Research 31 (1987) 85-93.
3. Beasley, J.E., "OR-Library: Distributing test problems by electronic mail", Journal of the Operational Research Society 41 (1990) 1069-1072.
4. Beasley, J.E., "A Lagrangian heuristic for set-covering problems", Naval Research Logistics 37 (1990) 151-164.
5. Beasley, J.E., and Jornsten, K., "Enhancing an algorithm for set covering problems", European Journal of Operational Research 58 (1992) 293-300.
6. Christofides, N., and Korman, S., "A computational survey of methods for the set covering problem", Management Science 21 (1975) 591-599.
7. Chvàtal, V., "A greedy heuristic for the set covering problem", Mathematics of Operations Research 4 (1979) 233-235.
8. Fisher, M.L., and Kedia, P., "Optimal solution of the set covering/partitioning problems using dual heuristics", Management Science 36 (1990) 674-688.
9. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
10. Garfinkel, R.S., and Nemhauser, G.L., Integer Programming, Wiley, New York, 1972.
11. Garfinkel, R.S., and Nemhauser, G.L., "Optimal set covering: A survey", in: A. Geoffrion (ed.), Perspectives on Optimization, Addison-Wesley, Reading, MA, 1972.
12. Haddadi, S., "Une approche par partitionnement des contraintes du problème de couverture d'ensemble", to appear in Investigacion Operativa.
13. Hochbaum, D.S., "Approximation algorithms for the set covering and vertex cover problems", SIAM Journal on Computing 11 (1982) 555-556.