Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties
In this paper we review many of the well-known algorithms for solving the shortest path problem in edge-weighted graphs. We then focus on a variant of this problem in which additional penalties are incurred at the vertices. These penalties can be used to model things like waiting times at road junct...
Na minha lista:
| Hovedforfatter: | |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
MDPI AG
2020-10-01
|
| Serier: | Algorithms |
| Fag: | |
| Online adgang: | https://www.mdpi.com/1999-4893/13/11/269 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|