Show simple item record

dc.contributor.authorPınar, Alien_US
dc.contributor.authorAykanat, Cevdeten_US
dc.coverage.spatialLyngby, Denmark
dc.date.accessioned2016-02-08T12:00:48Z
dc.date.available2016-02-08T12:00:48Z
dc.date.issued1996-08en_US
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11693/27748
dc.descriptionDate of Conference: 18-21 August, 1996
dc.descriptionConference name: International Workshop on Applied Parallel Computing PARA 1996: Applied Parallel Computing Industrial Computation and Optimization
dc.description.abstractAlthough 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.en_US
dc.language.isoEnglishen_US
dc.source.titleApplied Parallel Computing Industrial Computation and Optimization Third International Workshop, PARA '96en_US
dc.relation.isversionofhttps://doi.org/10.1007/3-540-62095-8_64
dc.subjectLinear programmingen_US
dc.subjectMatrix algebraen_US
dc.subjectOptimizationen_US
dc.subjectGraph partitioningen_US
dc.subjectGraph partitioning by vertex separatorsen_US
dc.subjectHypergraph modelen_US
dc.subjectHypergraph partitioningen_US
dc.subjectInherent parallelismen_US
dc.subjectMultilevel graph partitioningen_US
dc.subjectParallel solutionsen_US
dc.subjectSolution qualityen_US
dc.subjectGraph theoryen_US
dc.titleAn effective model to decompose linear programs for parallel solutionen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage592en_US
dc.citation.epage601en_US
dc.identifier.doi10.1007/3-540-62095-8_64
dc.publisherSpringeren_US
dc.contributor.bilkentauthorAykanat, Cevdet


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record