E. L. Lawler

Branch-and-Bound Methods: A Survey

E. L. Lawler, D. E. Wood, E. Lawler, 1966, Oper. Res..

Computing shortest paths in networks derived from recurrence relations

E. L. Lawler, E. Lawler, 1991, Ann. Oper. Res..

Minimization of Switching Circuits Subject to Reliability Conditions

E. L. Lawler, 1961, IRE Trans. Electron. Comput..

A Method for Solving Discrete Optimization Problems

E. L. Lawler, M. D. Bell, E. Lawler, 1966, Oper. Res..

A fully polynomial approximation scheme for the total tardiness problem

E. L. Lawler, E. Lawler, 1982, Oper. Res. Lett..

Minimization of Time-Varying Costs in Single-Machine Scheduling

B. D. Sivazlian, E. L. Lawler, E. Lawler, 1978, Oper. Res..