Computational problems of linear programing. - Abraham Charnes; Carlton E. Lemke (ACM National Meeting (Pittsburgh), 1952)

Direct Search Algorithms for Zero-One and Mixed-Integer Programming. - Carlton E. Lemke; Kurt Spielberg (Oper. Res., 1967)

Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems. - Carlton E. Lemke; H. M. Salkin; Kurt Spielberg (Oper. Res., 1971)

On generalizing shapley's index theory to labelled pseudomanifolds. - Carlton E. Lemke; Stephen J. Grotzinger (Math. Program., 1976)

Constructive proofs of theorems relating to: F(x) = y, with applications. - Abraham Charnes; C. B. García; Carlton E. Lemke (Math. Program., 1977)

Equivalence of LCP and PLS. - B. Curtis Eaves; Carlton E. Lemke (Math. Oper. Res., 1981)

A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem. - Robert D. Doverspike; Carlton E. Lemke (Math. Oper. Res., 1982)