A steepest-edge primal-dual network simplex algorithm
Conference
·
OSTI ID:35930
A description of a steepest-edge primal-dual simplex method is given for solving large minimum cost network flow problems. The algorithm incrementally satisfies the flow conservation constraints while choosing steepest-edge directions in a smaller dual subspace. Data structures that permit an exact implementation of these directions are designed to produce an efficient code. Computational results are presented to indicate the superiority of choosing steepest-edge directions over other dual ascent schemes. Computational comparisons with a network simplex code are also presented to demonstrate the efficiency of the primal-dual method.
- OSTI ID:
- 35930
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
The simplex algorithm with a new primal and dual pivot rule
The simplex method: The computational state of the art
A parallel forward network simplex algorithm and implementation
Technical Report
·
Tue Jun 01 00:00:00 EDT 1993
·
OSTI ID:10179889
The simplex method: The computational state of the art
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35841
A parallel forward network simplex algorithm and implementation
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35780