A MULTIPLE-ASSIGNMENT PROBLEM
Published • Apr 1, 1964
NobleIDNI7P312W265R138S539
Authors:,
David W. Walkup
M. Donald MacLaren
Abstract
Abstract : A generalization of Kuhn's simple assignment problem is considered: There are m men and n tasks given with each man qualified for certain of the tasks. The output from each task is given as a concave function of the number of qualified men assigned to it. Find an assignment of men to task...
Subject
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!