Letter to the Editor—The Multidimensional Assignment Problem
Author(s) -
William P. Pierskalla
Publication year - 1968
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.16.2.422
Subject(s) - assignment problem , computer science , variety (cybernetics) , branch and bound , mathematical optimization , dual (grammatical number) , generalized assignment problem , space (punctuation) , weapon target assignment problem , tree (set theory) , algorithm , mathematics , combinatorics , artificial intelligence , art , literature , operating system
The multidimensional assignment problem is a higher dimensional version of the standard two-dimensional assignment problem in the literature. The higher dimensions can be thought of as time or space dimensions or both. An algorithm is proposed for the solution of the multi-index assignment problem. The algorithm is based on a tree search technique of the branch-and-bound variety. It uses dual subproblems to provide easily computed bounds for the primal assignment problem.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom