1992 - Fellow of the American Association for the Advancement of Science (AAAS)
Mathematical optimization, Combinatorics, Combinatorial optimization, Sequence and Machine scheduling are his primary areas of study. His research links Theoretical computer science with Mathematical optimization. His biological study spans a wide range of topics, including Discrete mathematics, Bottleneck traveling salesman problem and Heuristics.
His Combinatorial optimization research is multidisciplinary, relying on both Computational complexity theory, Mathematical economics and Optimization problem. His research integrates issues of Weighted matroid, Matroid, Combinatorial principles, Combinatorial explosion and Matroid intersection in his study of Optimization problem. Eugene L. Lawler works mostly in the field of Algorithm, limiting it down to topics relating to Domain and, in certain cases, Branch and bound.
His main research concerns Mathematical optimization, Combinatorics, Discrete mathematics, Algorithm and Theoretical computer science. His work on Linear programming as part of general Mathematical optimization research is frequently linked to Preemption, Job shop scheduling, Machine scheduling and Open shop, bridging the gap between disciplines. His Open shop study contributes to a more complete understanding of Flow shop scheduling.
His Combinatorics study incorporates themes from Polynomial and Combinatorial optimization. His study explores the link between Discrete mathematics and topics such as Computation that cross with problems in Assignment problem. His study in the field of Time complexity is also linked to topics like Weighting and Tree rearrangement.
His primary areas of study are Mathematical optimization, Discrete mathematics, Combinatorics, Tree rearrangement and Algorithm. His study on Minimax is often connected to Preemption, Job shop scheduling and Machine scheduling as part of broader study in Mathematical optimization. His study in Open shop extends to Machine scheduling with its themes.
His research combines Approximation algorithm and Discrete mathematics. His Combinatorics research includes elements of Polynomial, String searching algorithm, Approximate string matching and Rabin–Karp algorithm. His Model of computation and Error detection and correction study in the realm of Algorithm interacts with subjects such as Game tree and Scheme.
His scientific interests lie mostly in Machine scheduling, Distributed computing, Parallel computing, Exponential function and Mathematical optimization. His Machine scheduling study frequently links to related topics such as Open shop. His Distributed computing research incorporates a variety of disciplines, including Fair-share scheduling, Fixed-priority pre-emptive scheduling, Dynamic priority scheduling, Rate-monotonic scheduling and Two-level scheduling.
His studies deal with areas such as Perfect information and Theoretical computer science as well as Exponential function.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
R.L. Graham;E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan.
Annals of discrete mathematics (1979)
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
R.L. Graham;E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan.
Annals of discrete mathematics (1979)
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan;D.B. Shmoys.
(1985)
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan;D.B. Shmoys.
(1985)
Combinatorial optimization: networks and matroids
Eugene L. Lawler.
(2021)
Combinatorial optimization: networks and matroids
Eugene L. Lawler.
(2021)
The traveling salesman problem
Eugene L. Lawler;Jan Karel Lenstra;Alexander H. G. Rinnooy Kan;David Shmoys.
(1985)
The traveling salesman problem
Eugene L. Lawler;Jan Karel Lenstra;Alexander H. G. Rinnooy Kan;David Shmoys.
(1985)
Branch-and-Bound Methods: A Survey
E. L. Lawler;D. E. Wood.
Operations Research (1966)
Branch-and-Bound Methods: A Survey
E. L. Lawler;D. E. Wood.
Operations Research (1966)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Centrum Wiskunde & Informatica
Cornell University
University of Pennsylvania
Dartmouth College
Princeton University
University of California, Riverside
University of Illinois at Urbana-Champaign
University of California, San Diego
University of California, San Diego
University of California, San Diego
University of California, Los Angeles
Korea Advanced Institute of Science and Technology
National Tsing Hua University
Université Libre de Bruxelles
University of Oxford
Delft University of Technology
Eindhoven University of Technology
Tsinghua University
Fukui University of Technology
Stockholm Resilience Centre
University of New England
Nordic Volcanological Center
Hydrologic Research Center
University of Pisa
Great Ormond Street Hospital
National Institutes of Health