Computational comparison of two solution procedures for allocation/processing networks

DOI10.1007/BFB0121099MaRDI QIDQ3712095zbMATH OpenFDO

Authors Michael Engquist, Chou-Hong Chen

Publication date 1986

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0121099

zbMATH Keywords

computational comparisonComputational resultslarge scaleMINOSnetwork flow algorithmsprimal partitioning algorithmprocessing networkssystemstest problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• An improved primal simplex variant for pure processing networks
• A Primal Simplex Approach to Pure Processing Networks
• scientific article; zbMATH DE number 556046
• The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
• scientific article; zbMATH DE number 515934

Cited in

(6)

• New labeling procedures for the basis graph in generalized networks
• Layering strategies for creating exploitable structure in linear and integer programs
• Extending and solving a multiperiod congested network flow model
• Future paths for integer programming and links to artificial intelligence
• Comparison of Allocation Algorithms for Mesh Structured Networks with Using Multistage Simulation
• A fast algorithm for bounded generalized processing networks

This page was built for publication: Computational comparison of two solution procedures for allocation/processing networks

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