netmic.heuristics.elementary_cycle_enumeration

Elementary Cycle Flows Heuristic.

 
Modules
       
netmic.algorithmic_utility
netmic.network_utility
networkx
time

 
Classes
       
elementaryCycleSolver

 
class elementaryCycleSolver
    Implementation of elementary cycle heuristic.
 
  Methods defined here:
__init__(self, N)
checkChangeToBound(self, r, cycle)
Return (negative) change in objective function after augmentation
along cycle with value r.
computeStartSolution(self)
Return b-feasible solution, computed with all bounds = +/- inf.
improved(self, v, w, r)
Return 1 if x+r would improve solution for a=(v,w), -1 if impaired,
0 otherwise.
solve(self, timelimit=900)
Compute elementary cycle heuristic.
For all elementary cycles, check if a cycle flow, with value such that
one bound is met, improves the solution.

 
Functions
       
enumerateElementaryCycles(N, timelimit=900)
Return cover obtained by elementary cycle heuristic.