Research Reports from the Department of Operations
Document Type
Report
Publication Date
4-1-1968
Abstract
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.
Keywords
Operations research, Assignment problem (Programming), Mathematical optimization, Algorithms, Branch and bound algorithms
Publication Title
Operations Research, vol. 16, no. 2, March-April 1968 ; Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 121
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Pierskalla, William P., "The Multidimensional Assignment Problem" (1968). Research Reports from the Department of Operations. 324.
https://commons.case.edu/wsom-ops-reports/324