On the dual coordinate ascent approach for nonlinear networks. - Norman D. Curet (Comput. Oper. Res., 1993)

A primal-dual simplex method for linear programs. - Norman D. Curet (Oper. Res. Lett., 1993)

An incremental primal-dual method for generalized networks. - Norman D. Curet (Comput. Oper. Res., 1994)

Applying steepest-edge techniques to a network primal-dual algorithm. - Norman D. Curet (Comput. Oper. Res., 1997)

Implementation of a steepest-edge primal - dualsimplex method for network linear programs. - Norman D. Curet (Ann. Oper. Res., 1998)

An efficient network flow code for finding all minimum cost s-t cutsets. - Norman D. Curet; Jason DeVinney; Matthew E. Gaston (Comput. Oper. Res., 2002)