J. Fred McDonald

According to our database, J. Fred McDonald authored at least 4 papers between 1989 and 1993.

Collaborative distances:

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

1993

Improving Hit-and-Run for global optimization.

Zelda B. Zabinsky, Robert L. Smith, J. Fred McDonald, H. Edwin Romeijn, David E. Kaufman

J. Glob. Optim., 1993

1992

On the best case performance of hit and run methods for detecting necessary constraints.

Richard J. Caron, Myron Hlynka, J. Fred McDonald

Math. Program., 1992

1991

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra.

C. G. E. Boender, Richard J. Caron, J. Fred McDonald, A. H. G. Rinnooy Kan, H. Edwin Romeijn, Robert L. Smith, Jan Telgen, A. C. F. Vorst

Oper. Res., 1991

1989

A new approach to the analysis of random methods for detecting necessary linear inequality constraints.

Richard J. Caron, J. Fred McDonald

Math. Program., 1989