Timeline for Do you know a shortest path algorithm for weighted graphs with hard time windows on the edges and waiting allowed?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 22, 2012 at 11:09 | history | tweeted | twitter.com/#!/StackCSTheory/status/194020103732465665 | ||
| Apr 20, 2012 at 9:08 | comment | added | Snowie | Using the time-space network, you can solve the problem with Dijkstra's algorithm. If you don't know the time-space network, you should investigate it (and the question might not be research-level). If you know it but you cannot use it for some reason, you should clarify your problem. | |
| Apr 20, 2012 at 7:41 | comment | added | Suresh Venkat | You need to wait at a node in order to use an edge (when it reactivates) | |
| Apr 20, 2012 at 7:26 | answer | added | Carlos Linares López | timeline score: 2 | |
| Apr 19, 2012 at 18:57 | history | edited | Kaveh |
edited tags
|
|
| Apr 19, 2012 at 18:27 | comment | added | Marzio De Biasi | Have you seen the paper: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length by A.Orda and R.Rom (1989)? | |
| Apr 19, 2012 at 16:19 | comment | added | kunigami | Is there any cost in waiting at a node? | |
| Apr 19, 2012 at 14:44 | comment | added | Sasho Nikolov | i don't get the waiting at the nodes part | |
| Apr 19, 2012 at 12:13 | history | asked | Christoph | CC BY-SA 3.0 |