A truncated primal-infeasible dual-feasible network interior point method
- 1 March 2000
- Vol. 35 (2) , 91-108
- https://doi.org/10.1002/(sici)1097-0037(200003)35:2<91::aid-net1>3.0.co;2-t
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear ProgramsMathematics of Operations Research, 1999
- A Study of Indicators for Identifying Zero Variables in Interior-Point MethodsSIAM Review, 1994
- A computational comparison of the dinic and network simplex methods for maximum flowAnnals of Operations Research, 1988
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow ProblemsOperations Research, 1988
- An efficient implementation of the network simplex methodPublished by Springer Nature ,1986
- Truncated-Newton algorithms for large-scale unconstrained optimizationMathematical Programming, 1983
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- The simplex SON algorithm for LP/embedded network problemsPublished by Springer Nature ,1981
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977