Optimal IIS Cover computation.

Modules
		netmic.heuristics.IISCover netmic.network_utility networkx pulp time netmic.timer

Classes
		netmic.heuristics.IISCover.IISSetCover(netmic.heuristics.IISCover.IISCover) setCover   class setCover(netmic.heuristics.IISCover.IISSetCover)     solve the set cover formulation, first greedily, then with a mip     Method resolution order: setCover netmic.heuristics.IISCover.IISSetCover netmic.heuristics.IISCover.IISCover Methods defined here: __init__(self, N, timelimit=1800) solve(self) Methods inherited from netmic.heuristics.IISCover.IISCover: coverFromSolution(self) Return cover according to final, feasible solution. findIIS(self, nonredundant=True) Update (list of) connected set S that violates GH-inequality.

Functions
		solveViaIISSetCover(N, timelimit=1800) Return cover computed via exakt set cover algorithm.