Daniel Harabor
From MaRDI portal
Person:2060695
Available identifiers
zbMath Open harabor.daniel-damirMaRDI QIDQ2060695
List of research outcomes
| Publication | Date of Publication | Type |
|---|---|---|
| https://portal.mardi4nfdi.de/entity/Q6052037 | 2023-09-20 | Paper |
| Branch-and-cut-and-price for multi-agent path finding | 2022-06-22 | Paper |
| Pairwise symmetry reasoning for multi-agent path finding search | 2021-12-13 | Paper |
| Fast optimal and bounded suboptimal Euclidean pathfinding | 2021-12-13 | Paper |
| Regarding Goal Bounding and Jump Point Search | 2021-03-26 | Paper |
| Rail Capacity Modelling with Constraint Programming | 2016-06-27 | Paper |
| Optimal Any-Angle Pathfinding In Practice | 2016-05-31 | Paper |
| Compressing Optimal Paths with Run Length Encoding | 2016-01-07 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
| Property | Value |
|---|---|
| MaRDI profile type | MaRDI person profile |
| instance of | human |
This page was built for person: Daniel Harabor
