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 |