Local Search Heuristics For The Multidimensional Assignment Problem Export

@article{gutin_local_2008, abstract = {The multidimensional assignment problem {(MAP)} (abbreviated {s-AP} in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of {MAP} is {3-AP,} though the problems with larger values of s have also a number of applications. In this paper we propose several local search heuristics for {MAP} and select the dominating ones. The results of computational experiments for several instance families are provided and discussed.}, author = {Gutin, Gregory and Karapetyan, Daniel}, citeulike-article-id = {3935819}, citeulike-linkout-0 = {http://arxiv.org/abs/0806.3258}, journal = {0806.3258}, keywords = {-, algorithms, and, computer, data, file-import-09-01-24, science, structures}, month = {June}, posted-at = {2009-01-24 14:53:13}, priority = {2}, title = {Local Search Heuristics For The Multidimensional Assignment Problem}, url = {http://arxiv.org/abs/0806.3258}, year = {2008} }

TY - JOUR ID - gutin_local_2008 L3 - citeulike-article-id:3935819 N2 - The multidimensional assignment problem {(MAP)} (abbreviated {s-AP} in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of {MAP} is {3-AP,} though the problems with larger values of s have also a number of applications. In this paper we propose several local search heuristics for {MAP} and select the dominating ones. The results of computational experiments for several instance families are provided and discussed. JF - 0806.3258 TI - Local Search Heuristics For The Multidimensional Assignment Problem KW - - KW - algorithms KW - and KW - computer KW - data KW - file-import-09-01-24 KW - science KW - structures AU - Gutin, Gregory AU - Karapetyan, Daniel PY - 2008/June// UR - http://arxiv.org/abs/0806.3258 ER -