New labeling procedures for the basis graph in generalized networks

DOI10.1016/0167-6377(85)90021-5zbMath0572.90095OpenAlexW2057093056MaRDI QIDQ1062633

Michael Engquist, Michael D. Chang

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90021-5

zbMATH Keywords

Computational resultsgeneralized networknetwork flow algorithmsbasis graphLabeling proceduresprimal simplex code

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (2)

An incremental primal-dual method for generalized networks ⋮ Parallel arc-allocation algorithms for optimizing generalized networks

Cites Work

• Unnamed Item
• A data structure for dynamic trees
• Solving Generalized Networks
• Computational comparison of two solution procedures for allocation/processing networks
• A Strongly Convergent Primal Simplex Algorithm for Generalized Networks
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Pivot Strategies for Primal-Simplex Network Codes
• Large-scale linearly constrained optimization
• Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
• Augmented Threaded Index Method For Network Optimization

This page was built for publication: New labeling procedures for the basis graph in generalized networks