On solving a variation of the assignment problem
Year of publication: |
1995
|
---|---|
Authors: | Armstrong, Ronald D. ; Jin, Zhiying |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 87.1995, 1, p. 142-147
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
ARTICLES - An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
Goldfarb, Donald, (1999)
-
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
Goldfarb, Donald, (1997)
-
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
Goldfarb, Donald, (1996)
- More ...