Changeset 813:25804ef35064 in lemon1.2 for lemon
 Timestamp:
 11/12/09 23:52:51 (10 years ago)
 Branch:
 default
 Phase:
 public
 Rebase:
 65336539373836373466333030303164666633626635373132396336363436646237366435313232
 Location:
 lemon
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/capacity_scaling.h
r812 r813 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
r812 r813 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.