An Exact Parallel Algorithm for the Resource Constrained Traveling Salesman Problem with Application to Scheduling with an Aggregate Deadline. - Joseph F. Pekny; Donald L. Miller (ACM Conference on Computer Science, 1990)

A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem. - Egon Balas; Donald L. Miller; Joseph F. Pekny; Paolo Toth (J. ACM, 1991)

A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem. - Joseph F. Pekny; Donald L. Miller; Daniel Stodolsky (Oper. Res. Lett., 1991)

A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. - Joseph F. Pekny; Donald L. Miller (Math. Program., 1992)

Commentary - The Role of Performance Metrics for Parallel Mathematical Programming Algorithms. - Donald L. Miller; Joseph F. Pekny (INFORMS J. Comput., 1993)

A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph. - Joseph F. Pekny; Donald L. Miller (INFORMS J. Comput., 1994)

A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems. - Donald L. Miller (INFORMS J. Comput., 1995)

A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities. - Donald L. Miller; Joseph F. Pekny (INFORMS J. Comput., 1995)

Optimizing Perioperative Decision Making: Improved Information for Clinical Workflow Planning. - Bradley N. Doebbeling; Matthew M. Burton; Spencer Miller; Donald L. Miller; Larry Baxter; Jorge Alvarez; Joseph F. Pekny (AMIA, 2012)