Changes in doc/groups.dox [771:8452ca46e29a:813:25804ef35064] in lemon-main
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r771 r813 407 407 - \ref NetworkSimplex Primal Network Simplex algorithm with various 408 408 pivot strategies \ref dantzig63linearprog, \ref kellyoneill91netsimplex. 409 - \ref CostScaling Push-Relabel and Augment-Relabel 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 Cycle-Canceling 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 Cycle-Canceling algorithms, two of which are 415 strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling. 418 416 419 417 In general NetworkSimplex is the most efficient implementation,
Note: See TracChangeset
for help on using the changeset viewer.