Ramachendra P. Batni

Learn More
The set covering problem is considered and an efficient procedure for finding an irredundant cover is presented. For an <italic>m</italic> &#215; <italic>n</italic> cover table, the execution time of the procedure is, in the worst case, proportional to <italic>mn</italic>. Methods are suggested for obtaining alternate irredundant covers based on an(More)
  • 1