An Efficient Algorithm for Finding an Irredundant Set Cover
Journal of the ACM (JACM)
A process for the determination of addresses in variable length addressing
Communications of the ACM
Extending SQL with graph matching and set covering for decision support applications
Journal of Management Information Systems
High-contrast algorithm behavior: observation, hypothesis, and experimental design
Proceedings of the 2007 workshop on Experimental computer science
High-contrast algorithm behavior: observation, conjecture, and experimental design
ecs'07 Experimental computer science on Experimental computer science
| Hi-index | 0.02 |
Computational experience with a modified linear programming method for the inequality or equality set covering problem (i.e. minimize cx subject to Ex ≥ e or Ex = e, xi = 0 or 1, where E is a zero-one matrix, e is a column of ones, and c is a nonnegative integral row) is presented. The zero-one composition of the constraint matrix and the right-hand side of ones suggested an algorithm in which dual simplex iterations are performed whenever unit pivots are available and Gomory all integer cuts are adjoined when they are not. Applications to enumerative and heuristic schemes are also discussed.