Efficient implementations of the BP heuristic for the shortest linear program (SLP) problem
In this article, we propose efficient implementations for the BP heuristic (the essential algorithm for the SLP problem). We first revisit the basic Paar algorithm. Next, we go through the details of the BP algorithm and discuss the bottleneck. We then propose two efficient approaches for efficient...
| Glavni autor: | |
|---|---|
| Daljnji autori: | |
| Format: | Final Year Project (FYP) |
| Jezik: | English |
| Izdano: |
Nanyang Technological University
2021
|
| Teme: | |
| Online pristup: | https://hdl.handle.net/10356/148476 |