Maximally disjoint solutions of the set covering problem

Journal of Heuristics

Volumn 7, Issue 2, 2001, Pages 131-144

  Hammer, Peter L ^a   Rader Jr , David J ^b  

^a RUTGERS UNIVERSITY   (United States)

^b ROSE HULMAN INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Disjoint solutions; GRASP algorithm; Set covering

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; NUMERICAL ANALYSIS; PROBLEM SOLVING;

DISJOINT SOLUTIONS; SET COVERING PROBLEMS;

SET THEORY;

EID: 0035276822     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009687403254     Document Type: Article

References (16)

1. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
2. Operations sequencing in discrete parts manufacturing
3. An algorithm for set covering problem
4. OR-library: Distributing test problems by electronic mail
5. A genetic algorithm for the set covering problem
6. 4-free subgraph
7. A greedy heuristic for the set covering problem
8. On some of my favorite problems in graph theory and block designs
9. A probabilistic heuristic for a computationally difficult set covering problem
10. Greedy randomized adaptive search procedures
11. Toward computing m (4)
12. Computational experience with approximation algorithms for the set covering problem
13. Maximum number of edges in a six-cube without four-cycles