Article ID: | iaor2003721 |
Country: | Germany |
Volume: | 91 |
Issue: | 2 |
Start Page Number: | 271 |
End Page Number: | 288 |
Publication Date: | Jan 2002 |
Journal: | Mathematical Programming |
Authors: | Goldfarb D., Lin Y., Jin Z. |
Keywords: | programming: linear |
This paper presents a polynomial-time dual simplex algorithm for the generalized circulation problem. An efficient implementation of this algorithm is given that has a worst-case running time of