Carlton E. Lemke

According to our database, Carlton E. Lemke authored at least 7 papers between 1952 and 1982.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1982

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

1981

Equivalence of LCP and PLS.

B. Curtis Eaves, Carlton E. Lemke

Math. Oper. Res., 1981

1977

Constructive proofs of theorems relating to: <i>F(x) = y</i>, with applications.

Abraham Charnes, C. B. García, Carlton E. Lemke

Math. Program., 1977

1976

On generalizing shapley's index theory to labelled pseudomanifolds.

Carlton E. Lemke, Stephen J. Grotzinger

Math. Program., 1976

1971

Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems.

Carlton E. Lemke, H. M. Salkin, Kurt Spielberg

Oper. Res., 1971

1967

Direct Search Algorithms for Zero-One and Mixed-Integer Programming.

Carlton E. Lemke, Kurt Spielberg

Oper. Res., 1967

1952

Computational problems of linear programing.

Abraham Charnes, Carlton E. Lemke

Proceedings of the 1952 ACM national meeting (Pittsburgh), 1952