A Network-Flow Model for Racially Balancing Schools. - Peter C. Belford; H. Donald Ratliff (Oper. Res., 1972)

A Graph-Theoretic Equivalence for Integer Programs. - Jean-Claude Picard; H. Donald Ratliff (Oper. Res., 1973)

Technical Note - A Production-Scheduling Problem with Batch Processing. - Robert C. Dorsey; Thom J. Hodgson; H. Donald Ratliff (Oper. Res., 1974)

Minimum cuts and related problems. - Jean-Claude Picard; H. Donald Ratliff (Networks, 1975)

Distance Constraints for Tree Network Multifacility Location Problems. - Richard L. Francis; Timothy J. Lowe; H. Donald Ratliff (Oper. Res., 1978)

A Cut Approach to the Rectilinear Distance Facility Location Problem. - Jean-Claude Picard; H. Donald Ratliff (Oper. Res., 1978)

Cyclic Scheduling via Integer Programs with Circular Ones. - John J. Bartholdi III; James B. Orlin; H. Donald Ratliff (Oper. Res., 1980)

A cut approach to a class of quadratic integer programming problems. - Jean-Claude Picard; H. Donald Ratliff (Networks, 1980)

Set partitioning based heuristics for interactive routing. - Frank H. Cullen; John J. Jarvis; H. Donald Ratliff (Networks, 1981)

Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem. - H. Donald Ratliff; Arnon S. Rosenthal (Oper. Res., 1983)

Optimal Node Ranking of Trees. - Ananth V. Iyer; H. Donald Ratliff; Gopalakrishnan Vijayan (Inf. Process. Lett., 1988)

Hierarchical solution of network flow problems. - Anant H. V. Lyer; John J. Jarvis; H. Donald Ratliff (Networks, 1990)

On an edge ranking problem of trees and graphs. - Ananth V. Iyer; H. Donald Ratliff; Gopalakrishnan Vijayan (Discret. Appl. Math., 1991)

Sequencing inputs to multi-commodity pipelines. - Christopher A. Hane; H. Donald Ratliff (Ann. Oper. Res., 1995)

Panel on Transportation and Logistics Modeling. - John S. Carson II; Mani S. Manivannan; Mark K. Brazier; Eric Miller; H. Donald Ratliff (WSC, 1997)

Minimal Connected Enclosures on an Embedded Planar Graph. - Christos Alexopoulos; J. Scott Provan; H. Donald Ratliff; Bryan R. Stutzman (Discret. Appl. Math., 1999)