Skip to main content
Conference Proceedings

Generalized assignment problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 650 LNCS 351-369
DOI: 10.1007/3-540-56279-6_88
15Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider generalized assignment problems with different objective functions: min-sum, max-sum, rain-max, max-min. We review transformations, bounds, approximation algorithms and exact algorithms. The results of extensive computational experiments are given.

Cite

CITATION STYLE

APA

Martello, S., & Toth, P. (1992). Generalized assignment problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 650 LNCS, pp. 351–369). Springer Verlag. https://doi.org/10.1007/3-540-56279-6_88

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free