Time-Dependent SHARC-Routing (Q3541096)

From MaRDI portal

Revision as of 20:09, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Time-Dependent SHARC-Routing	scientific article

Statements

scholarly article

0 references

Time-Dependent SHARC-Routing (English)

0 references

0 references

Algorithms - ESA 2008

0 references

publication date

25 November 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-87744-8_28

0 references

A note on two problems in connexion with graphs

0 references

Efficient models for timetable information in public transportation systems

0 references

The shortest route through a network with time-dependent internodal transit times

0 references

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

0 references

0 references

Bidirectional A ∗ Search for Time-Dependent Fast Paths

0 references

SHARC: Fast and Robust Unidirectional Routing

0 references

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-87744-8_28

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3541096

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3541096&oldid=35082209"