Parallel representation of local elimination algorithm for accelerating the solving sparse discrete optimization problems
The decomposition algorithms provide approaches to deal with NP-hardness in solving discrete optimization problems (DOPs). In this article one of the promising ways to exploit sparse matrices - local elimination algorithm in parallel interpretation (LEAP) are demonstrated. That is a graph-based stru...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Institute of Computer Science
2015-06-01
|
| Series: | Компьютерные исследования и моделирование |
| Subjects: | |
| Online Access: | http://crm.ics.org.ru/uploads/crmissues/crm_2015_3/15743.pdf |
| Summary: | The decomposition algorithms provide approaches to deal with NP-hardness in solving discrete optimization problems (DOPs). In this article one of the promising ways to exploit sparse matrices - local elimination algorithm in parallel interpretation (LEAP) are demonstrated. That is a graph-based structural decomposition algorithm, which allows to compute a solution in stages such that each of them uses results from previous stages. At the same time LEAP heavily depends on elimination ordering which actually provides solving stages. Also paper considers tree- and block-parallel for LEAP and required realization process of it comparison of a several heuristics for obtaining a better elimination order and shows how is related graph structure, elimination ordering and solving time. |
|---|---|
| ISSN: | 2076-7633 2077-6853 |