512

A new approach to the maximum flow problem
– Andrew V. Goldberg, Robert E. Tarjan
 1988

125

A fast parametric maximum flow algorithm and applications
– G Gallo, M D Grigoriadis, R E Tarjan
 1989

1402

Network Flows: Theory, Algorithms, and Applications
– R K Ahuja, T L Magnanti, J B Orlin
 1993

151

On implementing the pushrelabel method for the maximum flow problem
– Boris V. Cherkassky, Andrew V. Goldberg
 1994

455

Combinatorial optimization: networks and matroid
– E Lawler
 1976

50

A Faster Deterministic Maximum Flow Algorithm
– V King, S Rao, R Tarjan

8557

R.: Introduction to Algorithms
– T Cormen, C Leiserson, Rivest
 1990

28

Implementing Goldberg’s maxflow algorithm  a computational investigation. ZOR  Methods and models of Operations research
– U Derigs, W Meier
 1989

10

Efficient algorithms for the Hitchcock transportation problems
– T Tokuyama, J Nakano
 1995

369

Time bounds for selection
– Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert, E. Tarjan
 1973

272

Maximal Flow through a network
– L R Ford Jr, D R Fulkerson
 1956

11

A fast algorithm for the generalized parametric minimum cut problem and applications
– D Gusfield, C Martel
 1992

7

1982], Optimizing field repair kits based on job completion rate, Management Science 28:11
– J W Mamer, S A Smith

40

A selection problem of shared fixed costs and network flows
– J Rhys
 1970

4

provisioning, shared fixed costs, maximum closure, and implications on algorithmic method today
– D Hochbaum, Selection
 2004

38

Finding a Maximum Density Subgraph
– A V Goldberg
 1984

7

A faster parametric minimumcut algorithm
– D Gusfield, E Tados
 1994

99

An Efficient Implementation Of A Scaling MinimumCost Flow Algorithm
– Andrew V. Goldberg
 1992

226

Combinatorial Optimization
– William J. Cook, William H. Cunningham, William R. Pulleyblank, Alexander Schrijver
 1998
