New labeling procedures for the basis graph in generalized networks (Q1062633)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New labeling procedures for the basis graph in generalized networks |
scientific article; zbMATH DE number 3914109
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New labeling procedures for the basis graph in generalized networks |
scientific article; zbMATH DE number 3914109 |
Statements
New labeling procedures for the basis graph in generalized networks (English)
0 references
1985
0 references
Labeling procedures for the basis graph of a generalized network are introduced which build on procedures designed for pure networks. Computational results are presented which show that a primal simplex code which uses these procedures is about 60 times faster than a general purpose linear programming code.
0 references
network flow algorithms
0 references
Labeling procedures
0 references
basis graph
0 references
generalized network
0 references
Computational results
0 references
primal simplex code
0 references
0 references
