Pınar, AliAykanat, Cevdet2016-02-082016-02-081996-080302-9743http://hdl.handle.net/11693/27748Date of Conference: 18-21 August, 1996Conference name: International Workshop on Applied Parallel Computing PARA 1996: Applied Parallel Computing Industrial Computation and OptimizationAlthough inherent parallelism in the solution of block angulax Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular form for parallel solution is very rare and recent. We have previously proposed hypergraph models, which reduced the problem to the hypergraph partitioning problem. However, the quality of the results reported were limited due to the hypergraph partitioning tools we have used. Very recently, multilevel graph partitioning heuristics have been proposed leading to very successful graph partitioning tools; Chaco and Metis. In this paper, we propose an effective graph model to decompose matrices into block angular form, which reduces the problem to the well-known graph partitioning by vertex separator problem. We have experimented the validity of our proposed model with various LP problems selected from NETLIB and other sources. The results are very attractive both in terms of solution quality and running times. © Springer-Verlag Berlin Heidelberg 1996.EnglishLinear programmingMatrix algebraOptimizationGraph partitioningGraph partitioning by vertex separatorsHypergraph modelHypergraph partitioningInherent parallelismMultilevel graph partitioningParallel solutionsSolution qualityGraph theoryConference Paper10.1007/3-540-62095-8_64