Login / Signup
Use of dynamic trees in a network simplex algorithm for the maximum flow problem.
Andrew V. Goldberg
Michael D. Grigoriadis
Robert Endre Tarjan
Published in:
Math. Program. (1991)
Keyphrases
</>
network simplex algorithm
simplex algorithm
linear programming
feasible solution
multi objective optimization
multiple objectives
minimal cost
network flow problem