Norman D. Curet

According to our database, Norman D. Curet authored at least 6 papers between 1993 and 2002.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2002

An efficient network flow code for finding all minimum cost <i>s</i>-<i>t</i> cutsets.

Norman D. Curet, Jason DeVinney, Matthew E. Gaston

Comput. Oper. Res., 2002

1998

Implementation of a steepest-edge primal - dualsimplex method for network linear programs.

Norman D. Curet

Ann. Oper. Res., 1998

1997

Applying steepest-edge techniques to a network primal-dual algorithm.

Norman D. Curet

Comput. Oper. Res., 1997

1994

An incremental primal-dual method for generalized networks.

Norman D. Curet

Comput. Oper. Res., 1994

1993

A primal-dual simplex method for linear programs.

Norman D. Curet

Oper. Res. Lett., 1993

On the dual coordinate ascent approach for nonlinear networks.

Norman D. Curet

Comput. Oper. Res., 1993