A characterization of linear admissible transformations for the m-travelling salesmen problem: A result of Berenguer
Year of publication: |
1979
|
---|---|
Authors: | Lenstra, J. K. ; Rinnooy Kan, A. H. G. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 3.1979, 3, p. 250-252
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Job-shop scheduling by implicit enumeration
Lageweg, B. J., (1977)
-
Complexity results for scheduling chains on a single machine
Lenstra, J. K., (1980)
-
Generating all maximal independent sets : NP-hardness and polynominal-time algorithms
Lawler, E. L., (1978)
- More ...