Changeset 879:25804ef35064 in lemon
 Timestamp:
 11/12/09 23:52:51 (10 years ago)
 Branch:
 default
 Phase:
 public
 Rebase:
 65336539373836373466333030303164666633626635373132396336363436646237366435313232
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r818 r879 407 407  \ref NetworkSimplex Primal Network Simplex algorithm with various 408 408 pivot strategies \ref dantzig63linearprog, \ref kellyoneill91netsimplex. 409  \ref CostScaling PushRelabel and AugmentRelabel algorithms based on410 cost scaling\ref goldberg90approximation, \ref goldberg97efficient,409  \ref CostScaling Cost Scaling algorithm based on push/augment and 410 relabel operations \ref goldberg90approximation, \ref goldberg97efficient, 411 411 \ref bunnagel98efficient. 412  \ref CapacityScaling Successive Shortest %Path algorithm with optional 413 capacity scaling \ref edmondskarp72theoretical. 414  \ref CancelAndTighten The Cancel and Tighten algorithm 415 \ref goldberg89cyclecanceling. 416  \ref CycleCanceling CycleCanceling algorithms 417 \ref klein67primal, \ref goldberg89cyclecanceling. 412  \ref CapacityScaling Capacity Scaling algorithm based on the successive 413 shortest path method \ref edmondskarp72theoretical. 414  \ref CycleCanceling CycleCanceling algorithms, two of which are 415 strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling. 418 416 419 417 In general NetworkSimplex is the most efficient implementation, 
lemon/capacity_scaling.h
r878 r879 67 67 /// \ref CapacityScaling implements the capacity scaling version 68 68 /// of the successive shortest path algorithm for finding a 69 /// \ref min_cost_flow "minimum cost flow". It is an efficient dual 69 /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows, 70 /// \ref edmondskarp72theoretical. It is an efficient dual 70 71 /// solution method. 71 72 /// 
lemon/cost_scaling.h
r878 r879 91 91 /// 92 92 /// \ref CostScaling implements a cost scaling algorithm that performs 93 /// push/augment and relabel operations for finding a minimum cost 94 /// flow. It is an efficient primaldual solution method, which 93 /// push/augment and relabel operations for finding a \ref min_cost_flow 94 /// "minimum cost flow" \ref amo93networkflows, \ref goldberg90approximation, 95 /// \ref goldberg97efficient, \ref bunnagel98efficient. 96 /// It is a highly efficient primaldual solution method, which 95 97 /// can be viewed as the generalization of the \ref Preflow 96 98 /// "preflow pushrelabel" algorithm for the maximum flow problem.
Note: See TracChangeset
for help on using the changeset viewer.