TITLE

A NEW ALGORITHM FOR THE QUASI-ASSIGNMENT PROBLEM

AUTHOR(S)
Tiantai Song; Li Zhou
PUB. DATE
June 1990
SOURCE
Annals of Operations Research;1990, Vol. 24 Issue 1-4, p205
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The quasi-assignment problem can be used to solve the bus scheduling problem, the tourist guide problem, and the minimum number of chains in a partially ordered set. A successive shortest path algorithm for the assignment problem is extended to the quasi-assignment problem. The algorithm is a variation of the primal-dual algorithm, and its computational complexity is O(n³).
ACCESSION #
18656083

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics