Engquist, Michael; Chen, Chou-Hong Computational comparison of two solution procedures for allocation/processing networks. (English) Zbl 0585.90030 Math. Program. Study 26, 218-220 (1986). Summary: Computational results are presented comparing the Fortran implementation of a primal partitioning algorithm for processing networks with MINOS. A new class of test problems called allocation/processing network problems is introduced. Cited in 4 Documents MSC: 90B10 Deterministic network models in operations research 68Q25 Analysis of algorithms and problem complexity 65K05 Numerical mathematical programming methods 68R10 Graph theory (including graph drawing) in computer science 90C05 Linear programming 90C06 Large-scale problems in mathematical programming Keywords:computational comparison; network flow algorithms; large scale; systems; Computational results; primal partitioning algorithm; processing networks; MINOS; test problems PDFBibTeX XMLCite \textit{M. Engquist} and \textit{C.-H. Chen}, Math. Program. Study 26, 218--220 (1986; Zbl 0585.90030) Full Text: DOI