Solving Large Scale Generalized Networks (Q3682271)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3904363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Large Scale Generalized Networks |
scientific article; zbMATH DE number 3904363 |
Statements
Solving Large Scale Generalized Networks (English)
0 references
1985
0 references
network optimization
0 references
computational experiments
0 references
Alternative pivot strategies
0 references
Big-M starting method
0 references
large scale
0 references
0 references
0.8104491829872131
0 references
0.8098599314689636
0 references
0.8067287802696228
0 references
0.8045691251754761
0 references
The efficiency of a generalized network optimization program is investigated. The computational experiments are aimed at improving the internal tactical rules of the algorithm. Alternative pivot strategies are presented in conjunction with a dynamically-adjusted approach. Column normalization factors and the Big-M starting method are also analyzed. It is shown that carefully constructed internal tactics can improve the performance of the generalized network program, especially for large scale examples. The newly developed code compares quite favorably with a mature state-of-the-art program - NETG.
0 references