Goldfarb, Donald; Jin, Zhiying An \(O(nm)\)-time network simplex algorithm for the shortest path problem. (English) Zbl 0979.90116 Oper. Res. 47, No. 3, 445-448 (1999). MSC: 90C35 90C08 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{Z. Jin}, Oper. Res. 47, No. 3, 445--448 (1999; Zbl 0979.90116) Full Text: DOI
Armstrong, Ronald D.; Chen, Wei; Goldfarb, Donald; Jin, Zhiying Strongly polynomial dual simplex methods for the maximum flow problem. (English) Zbl 0894.90058 Math. Program. 80, No. 1 (A), 17-33 (1998). MSC: 90B10 90C60 90C35 PDFBibTeX XMLCite \textit{R. D. Armstrong} et al., Math. Program. 80, No. 1 (A), 17--33 (1998; Zbl 0894.90058) Full Text: DOI
Goldfarb, Donald; Chen, Wei On strongly polynomial dual simplex algorithms for the maximum flow problem. (English) Zbl 0889.90063 Math. Program. 78, No. 2 (B), 159-168 (1997). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{W. Chen}, Math. Program. 78, No. 2 (B), 159--168 (1997; Zbl 0889.90063) Full Text: DOI
Eckstein, Jonathan; Boduroğlu, İ. İlkay; Polymenakos, Lazaros C.; Goldfarb, Donald Data-parallel implementations of dense simplex methods on the Connection Machine CM-2. (English) Zbl 0842.90080 ORSA J. Comput. 7, No. 4, 402-416 (1995). MSC: 90C05 65Y05 PDFBibTeX XMLCite \textit{J. Eckstein} et al., ORSA J. Comput. 7, No. 4, 402--416 (1995; Zbl 0842.90080) Full Text: DOI Link
Goldfarb, Donald On the complexity of the simplex method. (English) Zbl 0809.90100 Gomez, Susana (ed.) et al., Advances in optimization and numerical analysis. Proceedings of the 6th workshop on optimization and numerical analysis, Oaxaca, Mexico, January 1992. Dordrecht: Kluwer Academic Publishers. Math. Appl., Dordr. 275, 25-38 (1994). MSC: 90C05 90C60 90B05 PDFBibTeX XMLCite \textit{D. Goldfarb}, Math. Appl., Dordr. 275, 25--38 (1994; Zbl 0809.90100)
Goldfarb, Donald; Hao, Jianxiu On the maximum capacity augmentation algorithm for the maximum flow problem. (English) Zbl 0810.90033 Discrete Appl. Math. 47, No. 1, 9-16 (1993). Reviewer: A.Girard (Verdun / Quebec) MSC: 90B10 90C60 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{J. Hao}, Discrete Appl. Math. 47, No. 1, 9--16 (1993; Zbl 0810.90033) Full Text: DOI
Goldfarb, Donald; Hao, Jianxiu Polynomial-time primal simplex algorithms for the minimum cost network flow problem. (English) Zbl 0761.90037 Algorithmica 8, No. 2, 145-160 (1992). MSC: 90B10 90C05 90C60 90-08 52B12 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{J. Hao}, Algorithmica 8, No. 2, 145--160 (1992; Zbl 0761.90037) Full Text: DOI
Forrest, John J.; Goldfarb, Donald Steepest-edge simplex algorithms for linear programming. (English) Zbl 0787.90047 Math. Program., Ser. A 57, No. 3, 341-374 (1992). MSC: 90C05 90C06 90-08 PDFBibTeX XMLCite \textit{J. J. Forrest} and \textit{D. Goldfarb}, Math. Program. 57, No. 3 (A), 341--374 (1992; Zbl 0787.90047) Full Text: DOI
Goldfarb, Donald; Hao, Jianxiu On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem. (English) Zbl 0754.90025 Oper. Res. Lett. 10, No. 7, 383-387 (1991). Reviewer: E.Ciurea (Braşov) MSC: 90B10 90C05 90C60 90-08 90C35 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{J. Hao}, Oper. Res. Lett. 10, No. 7, 383--387 (1991; Zbl 0754.90025) Full Text: DOI
Goldfarb, Donald; Hao, Jianxiu; Kai, Sheng-Roan Efficient shortest path simplex algorithms. (English) Zbl 0723.90083 Oper. Res. 38, No. 4, 624-628 (1990). Reviewer: H.-J.Presia (Ilmenau) MSC: 90C35 90C60 90-08 PDFBibTeX XMLCite \textit{D. Goldfarb} et al., Oper. Res. 38, No. 4, 624--628 (1990; Zbl 0723.90083) Full Text: DOI
Goldfarb, Donald; Hao, Jianxiu A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time. (English) Zbl 0713.90028 Math. Program., Ser. A 47, No. 3, 353-365 (1990). Reviewer: R.E.Burkard MSC: 90B10 90C60 90-08 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{J. Hao}, Math. Program. 47, No. 3 (A), 353--365 (1990; Zbl 0713.90028) Full Text: DOI
Goldfarb, Donald; Hao, Jianxiu; Kai, Sheng-Roan Anti-stalling pivot rules for the network simplex algorithm. (English) Zbl 0694.90095 Networks 20, No. 1, 79-91 (1990). Reviewer: M.Savelsbergh MSC: 90C35 90C05 65K05 PDFBibTeX XMLCite \textit{D. Goldfarb} et al., Networks 20, No. 1, 79--91 (1990; Zbl 0694.90095) Full Text: DOI
Goldfarb, Donald Efficient primal algorithms for strictly convex quadratic programs. (English) Zbl 0607.65035 Numerical analysis, Proc. 4th IIMAS Workshop, Guanajuato/Mex. 1984, Lect. Notes Math. 1230, 11-25 (1986). MSC: 65K05 90C20 90C25 PDFBibTeX XML
Goldfarb, D. Efficient dual simplex algorithms for the assignment problem. (English) Zbl 0578.90051 Math. Program. 33, 187-203 (1985). Reviewer: W.Stanczak MSC: 90C05 68Q25 65K05 90B10 68R10 05C35 PDFBibTeX XMLCite \textit{D. Goldfarb}, Math. Program. 33, 187--203 (1985; Zbl 0578.90051) Full Text: DOI
Goldfarb, Donald; Sit, William Y. Worst case behavior of the steepest edge simplex method. (English) Zbl 0423.90044 Discrete Appl. Math. 1, 277-285 (1979). MSC: 90C05 65K05 68Q25 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{W. Y. Sit}, Discrete Appl. Math. 1, 277--285 (1979; Zbl 0423.90044) Full Text: DOI
Goldfarb, D.; Reid, J. K. A practicable steepest-edge simplex algorithm. (English) Zbl 0443.90058 Math. Program. 12, 361-371 (1977). MSC: 90C05 65K05 PDFBibTeX XMLCite \textit{D. Goldfarb} and \textit{J. K. Reid}, Math. Program. 12, 361--371 (1977; Zbl 0443.90058) Full Text: DOI