Add to ORKGCover title.Includes bibliographical references (p. 12).Supported in part by the ONR. N00014-1-0099 Supported in part by a grant from the UPS Foundation.by Ravindra K. Ahuja, James B. Orlin
"April 1995."Includes bibliographical references (p. 55-57).by Ravindra K. Ahuja ... [et al.
AbstractThis paper reports on the implementation and computational experience obtained with a polyno...
In this paper, we are concerned with maximum flow problems with non-zero lower bounds. The common ap...
In this paper, we study the primal and dual simplex algorithms for the maximum flow problem. We show...
The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex al...
Several pivot rules for the dual network simplex algorithm that enable it to solve a maximum flow pr...
"November 1988."Includes bibliographical references (p. 24-26).Ravindra K. Ahyja and James B. Orlin
ENGLISH: Simplex algorithm is a mathematical procedure for solving linear programming problems ov...
"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P...
Cover title.Includes bibliographical references (p. 25-27).Supported by ONR. N00014-94-1-0099 Suppor...
We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]...
"Most of the results of this report were presented at the National ORSA/TIMS meeting, Chicago, May 1...
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. ...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
In a network with positive gains and without absorbing circuits (directed cycles) the problem of max...
"April 1995."Includes bibliographical references (p. 55-57).by Ravindra K. Ahuja ... [et al.
AbstractThis paper reports on the implementation and computational experience obtained with a polyno...
In this paper, we are concerned with maximum flow problems with non-zero lower bounds. The common ap...
In this paper, we study the primal and dual simplex algorithms for the maximum flow problem. We show...
The maximum flow problem (MFP) is a fundamental model in operations research. The network simplex al...
Several pivot rules for the dual network simplex algorithm that enable it to solve a maximum flow pr...
"November 1988."Includes bibliographical references (p. 24-26).Ravindra K. Ahyja and James B. Orlin
ENGLISH: Simplex algorithm is a mathematical procedure for solving linear programming problems ov...
"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P...
Cover title.Includes bibliographical references (p. 25-27).Supported by ONR. N00014-94-1-0099 Suppor...
We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]...
"Most of the results of this report were presented at the National ORSA/TIMS meeting, Chicago, May 1...
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. ...
Maximum flow problem is one of the fundamental problems in network flow theory and has been extensiv...
In a network with positive gains and without absorbing circuits (directed cycles) the problem of max...
"April 1995."Includes bibliographical references (p. 55-57).by Ravindra K. Ahuja ... [et al.
AbstractThis paper reports on the implementation and computational experience obtained with a polyno...
In this paper, we are concerned with maximum flow problems with non-zero lower bounds. The common ap...