Curet Norman D.

Norman D. Curet

Information about the author Norman D. Curet will soon be added to the site.
Found 7 papers in total
An efficient network flow code for finding all minimum cost s–t cutsets
An efficient network flow code for finding all minimum cost s–t cutsets
2002
Cutset algorithms have been well documented in the operations research literature. A...
The network diversion problem
The network diversion problem
2001
The network diversion problem can be viewed as an information operations network flow...
Implementation of a steepest-edge primal–dual simplex method for network linear programs
Implementation of a steepest-edge primal–dual simplex method for network linear programs
1998
A primal–dual simplex variant is presented that incrementally builds up the...
Applying steepest-edge techniques to a network primal–dual algorithm
Applying steepest-edge techniques to a network primal–dual algorithm
1997
This article addresses the computational efficacy of applying steepest-edge criteria...
An incremental primal-dual method for generalized networks
An incremental primal-dual method for generalized networks
1994
The primal simplex method has been computationally superior to primal-dual simplex and...
A primal-dual simplex method for linear programs
A primal-dual simplex method for linear programs
1993
A primal-dual algorithm is developed that optimizes a dual program in concert with...
On the dual coordinate ascent approach for nonlinear networks
On the dual coordinate ascent approach for nonlinear networks
1993
Dual coordinate ascent algorithms are popular methods for solving convex separable...
Papers per page: