A dynamic subgradient-based branch-and-bound procedure for set covering

Operations Research

Volumn 44, Issue 6, 1996, Pages 875-890

  Balas, Egon ^a   Carrera, Maria C ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Queues Enforth Development   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION;

BRANCH AND BOUND PROCEDURE; DYNAMIC SUBGRADIENT OPTIMIZATION;

SET THEORY;

EID: 0030282457     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.6.875     Document Type: Article

References (12)

1. E. BALAS AND A. Ho. 1980. Set Covering Algorithms Using Cutting Planes, Heuristics and Subgradient Optimization: A Computational Study. Math. Programming, 12, 37-60.
2. J. E. BEASLEY. 1987. An Algorithm for Set Covering Problems. European J. Opnl. Res. 31, 85-93.
3. J. E. BEASLEY. 1990. A Lagrangean Heuristic for Set Covering Problems. Naval Research Logist. 37, 151-164.
4. J. E. BEASLEY AND K. JORNSTEN. 1992. Enhancing an Algorithm for Set Covering Problems. European J. Opnl. Res. 58, 293-300.
5. M. C. CARRERA. 1984. Computational Study of Set Covering Heuristics. Master's Thesis, Department of Mathematics, Carnegie Mellon University.
6. J. DONGARRA. 1992. Performance of Various Computers Using Standard Linear Equations Software. Mathematical Sciences Section, Oak Ridge National Laboratory and Computer Science Department, University of Tennessee.
7. J. ETCHEBERRY. 1977. The Set Covering Problem: A New Implicit Enumeration Algorithm. Opns. Res. 25, 760-772.
8. M. L. FISHER AND P. KEDIA. 1990. Optimal Solution of Set Covering Problems Using Dual Heuristics. Mgmt. Sci. 36, 674-688.
9. N. G. HALL AND D. S. HOCHBAUM. 1986. A Fast Approximation Algorithm for the Multicovering Problem. Discrete Appl. Math. 15, 35-40.
10. F. HARCHE AND G. L. THOMPSON. 1989. The Column Subtraction Algorithm: An Exact Method for Solving Weighted Set Covering Problems. MSRR No. 548, GSIA, Carnegie Mellon University.
11. P. NOBILI AND A. SASSANO. 1992. A Separation Routine for the Set Covering Polytope. In E. Balas, G. Cornuejols, and R. Kannan (Eds.), Integer Programming and Combinatorial Optimization. Proceedings of the 2nd IPCO Conference, Carnegie Mellon University Press.
12. F. J. VASKO AND G. R. WILSON. 1984. An Efficient Heuristic for Large Set Covering Problems. Naval Research Logist. 31, 163-171.