## Coloring and duality: combinatorial augmentation methods |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

NETWORK FLOWS | 6 |

The Maximum Flow Problem as a Subproblem of the Minimum | 17 |

Description of the Cost Scaling Algorithm | 21 |

30 other sections not shown

### Common terms and phrases

Addititive Perturbation PARAMETERS augmenting base CHARACTERISTICS Supply Driven cocircuit CODE SCALE cost network flow cost scaling algorithm cycle defined Demands Perturbed Addititive direct sum dual pair EARLY TEST RUNS elements ellipsoid method Farkas FIT OF PROBABILITY FLOW INT FRAC given graph INT FRAC BIT INTERCEPT OF LEAST INVERSE NORMAL VALUES layered network Lemma linear programming maximum flow maximum flow problems MEAN DEVIATION minimum cost network NEGATIVE STUDENTIZED RESIDUALS NETGEN network flow problem NORMAL VALUES SLOPE NSNK FLOW INT NSRC NSNK FLOW NUMBER OF NODES optimal pair oriented matroid program orthogonal pair of oriented Perturbed Addititive Perturbation pivot rule Recursive Reduction RNET GNET SCALE RUNS GENERATOR CHARACTERISTICS satisfies alternative shortest path problems signature signed minor SIMPLEX ALGORITHM simplex method solving Standard Deviation Statistics for runs STATISTICS FOR SIMPLE STEMLEAF PLOT subsets Supplies and Demands SYMMETRIC EDGE DISTRIBUTED TEST OF FIT Theorem Uniform Distribution vector space Vergnas weakly oriented matroids