Cory J. Hoelting

According to our database, Cory J. Hoelting authored at least 5 papers between 1995 and 1999.

Collaborative distances:

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

1999

Analysis of fault location in a network.

Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wainwright

Ann. Oper. Res., 1999

1996

A genetic algorithm for the minimum broadcast time problem using a global precedence vector.

Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wainwright

Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

Finding investigator tours in telecommunication networks using genetic algorithms.

Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wainwright

Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

A Study of Fixed-Length Subset Recombination.

Kelly D. Crawford, Cory J. Hoelting, Roger L. Wainwright, Dale A. Schoenefeld

Proceedings of the 4th Workshop on Foundations of Genetic Algorithms. San Diego, 1996

1995

Approximation techniques for variations of the p-median problem.

Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wainwright

Proceedings of the 1995 ACM symposium on applied computing, 1995