Dick Helgason
"Preprocessing Schemes and a Solution Method for the Convex Hull Problem
in Multidimensional Space," (with J. Dula and B. Hickman),
in Computer Science and Operations Research:
New Developments in Their Interfaces,
Editors O. Balci, R. Sharda, and S. Zenios, Pergamon Press,
Oxford, England, (1992).
"The One-to-One Shortest-Path Problem: An Empirical Analysis with the
Two-Tree Dijkstra Algorithm," (with J. Kennington and B. Stewart),
Computational Optimization and Applications, 1, (1993), pp. 47-75.
"A Direct Simplex Algorithm for Network Flow Problems
with Convex Piecewise Linear Costs," (with R. Murthy),
Computational Optimization Methods and Software, 4, (1994), pp. 191-207.
"A Nearly Asynchronous Parallel LP-Based Algorithm
for the Convex Hull Problem in Multidimensional Space,"
(with J. Dula and N. Venugopal),
in The Impact of Emerging Technologies on Computer Science and Operations Research,
Editors S. Nash and A. Sofer, Kluwer, Boston, (1995) pp. 89-102.
"Primal Simplex Algorithms for Minimum Cost Network Flows,"
(with J. Kennington),
in Handbook on Operations Research and Management Science
Volume 7, Editors M. Ball, T. Magnanti, C. Monma, and G. Nemhauser,
North-Holland, Amsterdam, (1995) pp. 85-133.

Back to the SMU-OR page
