Login / Signup
An Effective Polynomial-Time Heuristic for the Minimum-Cardinality IIS Set-Covering Problem.
John W. Chinneck
Published in:
Ann. Math. Artif. Intell. (1996)
Keyphrases
</>
set covering problem
set covering
integer programming
branch and bound algorithm
bi objective
special case
column generation
search algorithm
worst case
distributed databases
approximation algorithms