Technical Note - Improved Conditions for Convergence in Undiscounted Markov Renewal Programming. - Loren K. Platzman (Oper. Res., 1977)

Finite memory estimation and control of finite probabilistic systems. - Loren K. Platzman (1977)

An O(N log N) planar travelling salesman heuristic based on spacefilling curves. - John J. Bartholdi III; Loren K. Platzman (Oper. Res. Lett., 1982)

A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane. - John J. Bartholdi III; Loren K. Platzman (Inf. Process. Lett., 1983)

A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms. - Loren K. Platzman; Jane C. Ammons; John J. Bartholdi III (Oper. Res., 1988)

A real-time AGV-scheduling system that combines human decision-making with integer-programming algorithms. - Joseph E. Krebs; Loren K. Platzman; Christine M. Mitchell (SMC, 1989)

Spacefilling curves and the planar travelling salesman problem. - Loren K. Platzman; John J. Bartholdi III (J. ACM, 1989)

Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities. - Steven T. Hackman; Loren K. Platzman (Oper. Res., 1990)

Building a Self-Organizing Urban Bus Route. - John J. Bartholdi III; Russell J. Clark 001; David W. Williamson; Donald D. Eisenstein; Loren K. Platzman (SASO Workshops, 2012)