Generating all maximal independent sets : NP-hardness and polynominal-time algorithms
Year of publication: |
1978
|
---|---|
Authors: | Lawler, E. L. ; Lenstra, J. K. ; Rinnooy Kan, A. H. G. |
Publisher: |
Amsterdam |
Subject: | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
Computing integral solutions of complementarity problems
Laan, Gerard van der, (2004)
- More ...
-
Minimizing maximum lateness in a two-machine open shop
Lawler, E. L., (1979)
-
At play in the fields of scheduling
Lawler, E. L., (1982)
-
Lenstra, J. K., (1979)
- More ...