Research Reports from the Department of Operations
Document Type
Report
Publication Date
10-1-1966
Abstract
In a previous paper we presented an algorithm which will find the optimal solution to the multi-index assignment problem. That algorithm was based on branch and bound techniques and the search was performed over the entire tree of feasible solutions. It is not felt that that algorithm will be particularly efficient for certain large multi-dimensional assignment problems. Thus, we now present a method which will achieve a close-to-optimal (if not the optimal) solution in a reasonable amount of time for moderately large three-index assignment problems.
Keywords
Operations research, Assignment problems (Programming), Mathematical optimization
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 71
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Pierskalla, William P., "The Tri-Substitution Method for Obtaining Near-Optimal Solutions to the Three-Dimensional Assignment Problem" (1966). Research Reports from the Department of Operations. 614.
https://commons.case.edu/wsom-ops-reports/614