Computational time comparisons
| Scenario | Type | Computational time (seconds) |
|---|---|---|
| #1 – Run A | Heuristic | 2.5 |
| #1 – Run B | Heuristic | 2.3 |
| #1 – BIP | BIP | 18.0 |
| #2 | Heuristic | 3.0 |
| #2 | BIP | 932.4 |
| #3 | Heuristic | 130.5 |
| #3 | BIP | * |
| Scenario | Type | Computational time (seconds) |
|---|---|---|
| #1 – Run A | Heuristic | 2.5 |
| #1 – Run B | Heuristic | 2.3 |
| #1 – BIP | BIP | 18.0 |
| #2 | Heuristic | 3.0 |
| #2 | BIP | 932.4 |
| #3 | Heuristic | 130.5 |
| #3 | BIP |
Note:
Scenario #3 was too computationally expensive to enumerate all acyclic paths required for the BIP
Sharing content requires targeting cookies to be enabled. Please update your cookie preferences to use this feature.