Dynamic shortest paths minimizing travel times and costs (Q4419276): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.10072 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1601277319 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59592538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weight paths in time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/networks/AhujaOPS03 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.10072 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:42, 30 December 2024

scientific article; zbMATH DE number 1958279
Language Label Description Also known as
English
Dynamic shortest paths minimizing travel times and costs
scientific article; zbMATH DE number 1958279

    Statements

    Dynamic shortest paths minimizing travel times and costs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 July 2003
    0 references
    shortest path problem
    0 references
    dynamic shortest path problem
    0 references
    transportation network
    0 references
    traffic network
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references