| |
| 2002 | ||
|---|---|---|
| 4 | EE | Norman D. Curet, Jason DeVinney, Matthew E. Gaston: An efficient network flow code for finding all minimum cost s-t cutsets. Computers & OR 29(3): 205-219 (2002) |
| 1997 | ||
| 3 | EE | Norman D. Curet: Applying steepest-edge techniques to a network primal-dual algorithm. Computers & OR 24(7): 601-609 (1997) |
| 1994 | ||
| 2 | EE | Norman D. Curet: An incremental primal-dual method for generalized networks. Computers & OR 21(10): 1051-1059 (1994) |
| 1993 | ||
| 1 | EE | Norman D. Curet: On the dual coordinate ascent approach for nonlinear networks. Computers & OR 20(2): 133-140 (1993) |
| 1 | Jason DeVinney | [4] |
| 2 | Matthew E. Gaston | [4] |