A fast algorithm for bounded generalized processing networks

DOI10.1002/NET.3230240202MaRDI QIDQ4285457zbMATH OpenOpenAlexFDO

Authors

Publication date 24 March 1994

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230240202

zbMATH Keywords

heuristic algorithmbounded generalized processing networkcost-minimizing generalized network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Faster algorithms for the generalized network flow problem
• Generalized Networks: Parallel Algorithms and an Empirical Analysis
• A fast network-decomposition algorithm and its applications to constant-time distributed computation
• scientific article; zbMATH DE number 125151
• A fast network-decomposition algorithm and its applications to constant-time distributed computation (extended abstract)
• Maximum flows in generalized processing networks
• A Primal Simplex Approach to Pure Processing Networks
• Fast Algorithms for Bipartite Network Flow
• Improving time bounds on maximum generalised flow computations by contracting the network
• scientific article; zbMATH DE number 2086656

Cites work

• Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
• Computational comparison of two solution procedures for allocation/processing networks

Cited in

(3)

• Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks
• An algorithm to solve the proportional network flow problem
• The Solution of Multiperiod Network Models with Bundle Constraints by Aggregation

This page was built for publication: A fast algorithm for bounded generalized processing networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285457)