Narrow search
Showing 1 - 5 of 5
Cover Image
A characterization of linear admissible transformations for the m-travelling salesmen problem: A result of Berenguer
Lenstra, J. K.; Rinnooy Kan, A. H. G. - In: European Journal of Operational Research 3 (1979) 3, pp. 250-252
Persistent link: https://www.econbiz.de/10005075129
Cover Image
Complexity results for scheduling chains on a single machine
Lenstra, J. K.; Rinnooy Kan, A. H. G. - In: European Journal of Operational Research 4 (1980) 4, pp. 270-275
Persistent link: https://www.econbiz.de/10005347376
Cover Image
Machine allocation problems in manufacturing networks
Boxma, O. J.; Rinnooy Kan, A. H. G.; van Vliet, M. - In: European Journal of Operational Research 45 (1990) 1, pp. 47-54
Persistent link: https://www.econbiz.de/10005240285
Cover Image
An appraisal of computational complexity for operations researchers
Lenstra, J. K.; Rinnooy Kan, A. H. G.; Van Emde Boas, P. - In: European Journal of Operational Research 11 (1982) 3, pp. 201-210
Persistent link: https://www.econbiz.de/10005253568
Cover Image
Branching from the largest upper bound Folklore and facts
Fox, B. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.; … - In: European Journal of Operational Research 2 (1978) 3, pp. 191-194
Persistent link: https://www.econbiz.de/10005284108