Williamson, D. P.; Hall, L. A.; Hoogeveen, J. A.; Hurkens, C. A. J.; Lenstra, J. K.; Sevast’janov, S. V.; Shmoys, D. B. Short shop schedules. (English) Zbl 0890.90112 Oper. Res. 45, No. 2, 288-294 (1997). MSC: 90B35 PDFBibTeX XMLCite \textit{D. P. Williamson} et al., Oper. Res. 45, No. 2, 288--294 (1997; Zbl 0890.90112) Full Text: DOI Link
Aardal, Karen; van Hoesel, Stan; Lenstra, Jan Karel; Stougie, Leen A decade of combinatorial optimization. (English) Zbl 0880.90113 Klein Haneveld, W. K. (ed.) et al., Ten years LNMB. Ph.D. research and graduate courses of the Dutch network of operations research. Amsterdam: CWI. CWI Tracts. 122, 5-14 (1997). MSC: 90C27 01A65 PDFBibTeX XMLCite \textit{K. Aardal} et al., in: Ten years LNMB. Ph.D. research and graduate courses of the Dutch network of operations research. Amsterdam: CWI. 5--14 (1997; Zbl 0880.90113)
Labetoulle, J.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G. Preemptive scheduling of uniform machines subject to release dates. (English) Zbl 0554.90059 Progress in combinatorial optimization, Conf. Waterloo/Ont. 1982, 245-261 (1984). MSC: 90B35 68Q25 PDFBibTeX XML
Lenstra, A. K.; Lenstra, J. K.; Kan, A. H. G. Rinnooy; Wansbeek, T. J. Two lines least squares. (English) Zbl 0495.62071 Ann. Discrete Math. 16, 201-211 (1982). MSC: 62J05 65C99 68Q25 62P20 PDFBibTeX XMLCite \textit{A. K. Lenstra} et al., Ann. Discrete Math. 16, 201--211 (1982; Zbl 0495.62071) Full Text: DOI
Lawler, E. L.; Lenstra, J. K. Machine scheduling with precedence constraints. (English) Zbl 0474.68057 Math. Cent., Amst., Afd. Math. Beslisk. BW 148/81, 18 p. (1981). MSC: 68M20 68Q25 90B35 PDFBibTeX XML
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G. Recent developments in deterministic sequencing and scheduling: A survey. (English) Zbl 0474.68056 Math. Cent., Amst., Afd. Math. Beslisk. BW 146/81, 39 p. (1981). MSC: 68M20 68Q25 90B35 PDFBibTeX XML
Lenstra, A. K.; Lenstra, J. K.; Rinnooy Kan, A. H. G.; Wansbeek, T. J. Two lines least squares. (English) Zbl 0451.62052 Math. Cent., Amst., Afd. Math. Beslisk. BW 134/81, 14 p. (1981). MSC: 62J05 62P20 68Q25 PDFBibTeX XML
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. (English) Zbl 0445.68054 SIAM J. Comput. 9, 558-565 (1980). MSC: 68R99 68R10 68Q25 68W99 PDFBibTeX XMLCite \textit{E. L. Lawler} et al., SIAM J. Comput. 9, 558--565 (1980; Zbl 0445.68054) Full Text: DOI Link
Lenstra, J. K.; Rinnooy Kan, A. H. G. An introduction to multiprocessor scheduling. (English) Zbl 0423.90031 Math. Cent., Amst., Afd. Math. Beslisk. BW121/80, P. 18 (1980). MSC: 90B35 90-01 PDFBibTeX XML
Lenstra, J. K.; Rinnooy Kan, A. H. G. Complexity of vehicle routing and scheduling problems. (English) Zbl 0416.90049 Math. Cent., Amst., Afd. Math. Beslinsk. BW 111/79, 11 p. (1979). MSC: 90C10 90C35 90-02 90B35 68Q25 68Q60 PDFBibTeX XML
Lenstra, J. K.; Peled, U. N. Report of the session on algorithms for special classes of combinatorial optimization problems. (English) Zbl 0412.68035 Ann. Discrete Math. 4, 295-299 (1979). MSC: 68Q25 05B35 05A17 05A99 05B99 05C99 PDFBibTeX XMLCite \textit{J. K. Lenstra} and \textit{U. N. Peled}, Ann. Discrete Math. 4, 295--299 (1979; Zbl 0412.68035) Full Text: DOI