On the variable-depth-search heuristic for the linear-cost generalized assignment problem

The classical assignment problem seeks to determine a mapping between a set of assignees and a set of assignments. The linear cost assignment problem (LCGAP), as a generalized model, incorporates the relative workloads between assignees and assignments. Although LCGAP is computationally intractable,...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 77; no. 4; pp. 535 - 544
Main Authors:	Lin, Bertrand M.T., Huang, Y.S., Yu, H.K.
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01.01.2001 Taylor and Francis
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximate solutions Assignment problem Computer science; control theory; systems Exact sciences and technology F 2.1 Flows in networks. Combinatorial problems Heuristic algorithm Operational research and scientific management Operational research. Management science Personnel management Theoretical computing Variable depth search heuristic method Heuristic algorithm Resource allocation Heuristic method Linear cost assignement problem Information retrieval Cost analysis Personnel Approximate solution
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!