# Changes in /[869:1b89e29c9fc7:888:f903263902f6] in lemon

Ignore:
Files:
6 edited

Unmodified
Removed
• ## doc/groups.dox

 r818 - \ref NetworkSimplex Primal Network Simplex algorithm with various pivot strategies \ref dantzig63linearprog, \ref kellyoneill91netsimplex. - \ref CostScaling Push-Relabel and Augment-Relabel algorithms based on cost scaling \ref goldberg90approximation, \ref goldberg97efficient, - \ref CostScaling Cost Scaling algorithm based on push/augment and relabel operations \ref goldberg90approximation, \ref goldberg97efficient, \ref bunnagel98efficient. - \ref CapacityScaling Successive Shortest %Path algorithm with optional capacity scaling \ref edmondskarp72theoretical. - \ref CancelAndTighten The Cancel and Tighten algorithm \ref goldberg89cyclecanceling. - \ref CycleCanceling Cycle-Canceling algorithms \ref klein67primal, \ref goldberg89cyclecanceling. - \ref CapacityScaling Capacity Scaling algorithm based on the successive shortest path method \ref edmondskarp72theoretical. - \ref CycleCanceling Cycle-Canceling algorithms, two of which are strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling. In general NetworkSimplex is the most efficient implementation,
• ## lemon/Makefile.am

 r863 lemon/binom_heap.h \ lemon/bucket_heap.h \ lemon/capacity_scaling.h \ lemon/cbc.h \ lemon/circulation.h \ lemon/concept_check.h \ lemon/connectivity.h \ lemon/core.h \ lemon/cost_scaling.h \ lemon/counter.h \ lemon/core.h \ lemon/cplex.h \ lemon/cycle_canceling.h \ lemon/dfs.h \ lemon/dijkstra.h \