Narrow search
Showing 1 - 4 of 4
Cover Image
Exponentially better than brute force: solving the jobshop scheduling problem optimally by dynamic programming
Gromicho, Joaquim A. S.; Hoorn, Jelke J. van; … - 2010
Persistent link: https://www.econbiz.de/10003984931
Cover Image
Deterministic production planning : algorithms and complexity
Florian, M.; Lenstra, J. K.; Kan, A. H. G. Rinnooy - 1978
Persistent link: https://www.econbiz.de/10001562722
Cover Image
The complexity of the network design problem
Johnson, D. S.; Lenstra, J. K.; Kan, A. H. G. Rinnooy - 1977
Persistent link: https://www.econbiz.de/10001563000
Cover Image
Generating all maximal independent sets : NP-hardness and polynominal-time algorithms
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G. - 1978
Persistent link: https://www.econbiz.de/10003546988