Richard V. Helgason

According to our database1, Richard V. Helgason authored at least 11 papers between 1977 and 2006.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
Minimum Cost Network Flow Algorithms.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2001
Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation.
J. Heuristics, 2001

1998
An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull.
INFORMS J. Comput., 1998

1993
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm.
Comput. Optim. Appl., 1993

1992
Preprocessing Schemes and a Solution Method for the Convex Hull Problem in Multidimensional Space.
Proceedings of the Computer Science and Operations Research, 1992

1987
A generalization of Polyak's convergence result for subgradient optimization.
Math. Program., 1987

1985
Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs.
Transp. Sci., 1985

1980
A polynomially bounded algorithm for a singly constrained quadratic program.
Math. Program., 1980

Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms.
Oper. Res., 1980

1978
Primal simplex network codes: State-of-the-art implementation technology.
Networks, 1978

1977
A product form representation of the inverse of a multicommodity cycle matrix.
Networks, 1977


  Loading...