Research Reports from the Department of Operations

Document Type

Report

Publication Date

10-1-1966

Abstract

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, AIMD algorithms, Assignment problems (Programming), Mathematics--Research, Branch and bound algorithms

Publication Title

Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University

Issue

Technical memorandum no. 69

Rights

This work is in the public domain and may be freely downloaded for personal or academic use

Download

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.