| | |
- IISCover
-
- IISFixedCover
- IISHittingSet
- IISSetCover
class IISCover |
| |
provides functionality to compute IISs via max-flow and cover them
|
| |
Methods defined here:
- __init__(self, N)
- coverFromSolution(self)
- Return cover according to final, feasible solution.
- findIIS(self, nonredundant=True)
- Update (list of) connected set S that violates GH-inequality.
|
class IISFixedCover(IISCover) |
| |
derived from IISCover, covers IISs by chosing the lowest bounded arc for
every IIS
|
| |
Methods defined here:
- solve(self, nonredundant, timelimit=900)
- Compute an IIS in current network, set some bounds to inf and repeat
until there are no more IISs.
Methods inherited from IISCover:
- __init__(self, N)
- coverFromSolution(self)
- Return cover according to final, feasible solution.
- findIIS(self, nonredundant=True)
- Update (list of) connected set S that violates GH-inequality.
|
class IISHittingSet(IISCover) |
| |
derived from IISCover, covers IISs by chosing the arc that covers the most
IISs
|
| |
Methods defined here:
- __init__(self, N)
- solve(self, nonredundant, timelimit=900)
- Compute an IIS in current network, use a hitting set heuristic and
repeat until there are no more IISs.
Methods inherited from IISCover:
- coverFromSolution(self)
- Return cover according to final, feasible solution.
- findIIS(self, nonredundant=True)
- Update (list of) connected set S that violates GH-inequality.
|
class IISSetCover(IISCover) |
| |
derived from IISCover, covers IISs by a greedy solution to the set cover
problem in every step
|
| |
Methods defined here:
- __init__(self, N)
- solve(self, nonredundant, timelimit=900)
- Compute an IIS in current network, heuristically solve the set cover
problem and repeat until there are no more IISs.
Methods inherited from IISCover:
- coverFromSolution(self)
- Return cover according to final, feasible solution.
- findIIS(self, nonredundant=True)
- Update (list of) connected set S that violates GH-inequality.
| |