On the Unlimited Number of Faces in Integer Hulls of Linear Programs with a Single Constraint. - David S. Rubin (Oper. Res., 1970)

Technical Note - Strengthened Dantzig Cuts for Integer Programming. - David S. Rubin; Robert L. Graves (Oper. Res., 1972)

Technical Note - Rationalizing Discrete Programs. - Floyd J. Gould; David S. Rubin (Oper. Res., 1973)

Technical Note - Vertex Generation and Cardinality Constrained Linear Programs. - David S. Rubin (Oper. Res., 1975)

LPMPS: A student oriented preprocessor for MPS/360. - Patrick G. McKeown; David S. Rubin (Comput. Oper. Res., 1977)

A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets. - T. H. Matheiss; David S. Rubin (Math. Oper. Res., 1980)

Bounding the variance in Monte Carlo experiments. - George S. Fishman; David S. Rubin (Oper. Res. Lett., 1992)

Evaluating Best-Case and Worst-Case Variances When Bounds are Available. - George S. Fishman; Boris L. Granovsky; David S. Rubin (SIAM J. Sci. Comput., 1992)