Eugene L. Lawler

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jan Karel Lenstra

> Home > Persons > Eugene L. Lawler

Publications

1993
[p1]
- view
  authority control:
- export record
  dblp key:
  - books/el/93/LawlerLKS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/el/93/LawlerLKS93
Eugene L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys:
Chapter 9 Sequencing and scheduling: Algorithms and complexity. Logistics of Production and Inventory 1993: 445-522
1983
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/ior/BakerLLK83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ior/BakerLLK83
K. R. Baker, Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints. Oper. Res. 31(2): 381-386 (1983)
1982
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/LawlerLK82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/LawlerLK82
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Erratum. Math. Oper. Res. 7(4): 635 (1982)
1981
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/LawlerLK81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/LawlerLK81
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Minimizing Maximum Lateness in a Two-Machine Open Shop. Math. Oper. Res. 6(1): 153-158 (1981)
1980
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/LawlerLK80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/LawlerLK80
Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. SIAM J. Comput. 9(3): 558-565 (1980)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.