Douglas R. Shier

Research Interests: Operations Research, Network Optimization, Discrete Mathematics, Algorithms.

Recent Publications:

• "Spanning trees: let me count the ways," Mathematics Magazine 73 (2000), 376-381.
• "Graph theory," in Encyclopedia of Operations Research and Management Science, 2nd Edition, Kluwer, 2001, pp. 339-342.
• "Discrete mathematics and combinatorics," in Encyclopedia of Physical Science and Technology, 3rd edition, Vol. 4, Academic Press, 2002, pp. 523-534.
• "Cancellation in cyclic consecutive systems," J. Computational and Applied Mathematics 142 (2002), 13-26. With N.J. Calkin, J.D. Edds.
• "Minimax models for diverse routing," INFORMS J. Computing 14 (2002), 81-95. With J. Brumbaugh-Smith.
• "A lattice-based approach to matched pairs tests," Congressus Numerantium 155 (2003), 5-13.
• "Algorithms for the weight distribution of a minimum spanning tree in a stochastic network," Proceedings of the INOC 2003 Conference, 2003, pp. 279-285. With K. R. Hutson.
• "Matchings and assignments" in Handbook of Graph Theory, CRC Press, 2004, pp. 1103-1116.
• "A heuristic method to solve the size assortment problem," The Next Wave in Computing, Optimization, and Decision Technologies, Kluwer, 2005, pp. 121-132. With K. W. Flowers and B. A. Novick.
• "Bounding distributions for the weight of a minimum spanning tree in stochastic networks," Operations Research 53 (2005), 879-886. With K. R. Hutson.
• "Minimum spanning tree in networks with varying edge weights," Annals of Operations Research 146 (2006), 3-18. With K. R. Hutson.
• "Network modelling," in Handbook on Modelling for Discrete Optimization, Springer, 2006, pp. 129-149.
• "Optimization models for scheduling of jobs," NIST Journal of Research 111 (2006), 103-111. With S. Indika.
• "Cut scheduling in the apparel industry," Computers and Operations Research 34 (2007), 3209-3228. With D. M. Rose.
• "Label-correcting shortest path algorithms revisited," Perspectives in Operations Research, Springer, 2006, pp. 179-197. With M. G. Bardossy.
• "On the distributed Bellman-Ford algorithm and the looping problem," INFORMS J. Computing 19 (2007), 542-551. With K. R. Hutson and T. L. Schlosser.
• "An efficient enumeration algorithm for the two-sample randomization distribution,"Advances in Computing, Optimization, and Decision Technologies, Springer, 2007, pp. 61-75. With M. Coffin and J.P. Jarvis.
• "Computational issues in network reliability," Encyclopedia of Statistics in Quality and Reliability, Wiley, 2008. With C. J. Colbourn.
• "Extended domination for a stochastic shortest path problem," Computers and Operations Research 36 (2009), 584-596. With K. R. Hutson.
• "Generating random test networks for shortest path algorithms," Operations Research and Cyber-Infrastructure, Springer, 2009, pp. 295-308. With D. Adams-Smith.