Computational comparison of two solution procedures for allocation/processing networks

DOI10.1007/BFb0121099zbMath0585.90030MaRDI QIDQ3712095

Michael Engquist, Chou-Hong Chen

Publication date: 1986

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

zbMATH Keywords

systemstest problemslarge scalecomputational comparisonComputational resultsnetwork flow algorithmsMINOSprocessing networksprimal partitioning algorithm

Mathematics Subject Classification ID

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

Related Items

A fast algorithm for bounded generalized processing 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, New labeling procedures for the basis graph in generalized networks