Loading…
Basis properties and algorithmic specializations for gub transformed networks
Applying standard transformations of generalized upper bounding (GUB) theory to a pure or generalized network basis is shown to yield a reduced working basis that is itself a basis for a reduced network. As a result, the working basis can be represented via specialized data structures for networks....
Saved in:
Published in: | Operations research letters 1983-01, Vol.2 (3), p.95-100 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Applying standard transformations of generalized upper bounding (GUB) theory to a pure or generalized network basis is shown to yield a reduced working basis that is itself a basis for a reduced network. As a result, the working basis can be represented via specialized data structures for networks. The resultant GUB based specializations to the network simplex algorithm are described. |
---|---|
ISSN: | 0167-6377 1872-7468 |
DOI: | 10.1016/0167-6377(83)90013-5 |