## Netflow at Pisa |

### What people are saying - Write a review

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

### Contents

Preface v | 1 |

F Glover R Glover and D Klingman Threshold assignment algorithm | 12 |

A unifying approach | 38 |

Copyright | |

12 other sections not shown

### Common terms and phrases

active demand node arc i,j assignment algorithm assignment problem augmenting path Benders cut Benders decomposition blocking flow branch and bound capacity codes complexity computational results constraints convex cost flow problem cost functions cost network flow data structures denote DRPP dual feasible dual variables edge efficient feasible solution Florian flow algorithms flow augmentation formulation forward star graph heuristic implementation infeasible integer programming iteration Klingman linear programming lower bound Magnanti Management Science Mathematical Programming matrix maximum flow maximum flow problem network design problem network equilibrium problem network flow problems network problems Nguyen nonlinear nonnegative objective function obtained Operations Research optimal solution pivots primal procedure scanned selected shortest path algorithm shortest path problem shortest path tree simplex algorithm simplex method solution pass solve step strategy subproblem subtree superbasic test problems transportation problem update Usual Strong Pareto variational inequality vector vertex vertices zero