A Class of Polynomially Solvable Set-Covering Problems.

Paola Bertolazzi Antonio Sassano

Published in: SIAM J. Discret. Math. (1988)

Keyphrases

set covering problem
polynomially solvable
processing times
neural network
minimum cost
set covering
np hard
np complete
integer programming
makespan minimization