Algorithms for the quickest path problem and the reliable quickest path problem (Q373197): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6217589 / rank
 
Normal rank
Property / zbMATH Keywords
 
quickest path
Property / zbMATH Keywords: quickest path / rank
 
Normal rank
Property / zbMATH Keywords
 
reliability
Property / zbMATH Keywords: reliability / rank
 
Normal rank
Property / zbMATH Keywords
 
recursive constraint
Property / zbMATH Keywords: recursive constraint / rank
 
Normal rank
Property / zbMATH Keywords
 
ranking quickest paths
Property / zbMATH Keywords: ranking quickest paths / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NETGEN / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10287-012-0138-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028546357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest chain subject to side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem with interval lead times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem with batch constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(k\) quickest simple paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A label-setting algorithm for finding a quickest path / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive survey on the quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the quickest path problem and the enumeration of quickest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:57, 6 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for the quickest path problem and the reliable quickest path problem
scientific article

    Statements

    Algorithms for the quickest path problem and the reliable quickest path problem (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2013
    0 references
    quickest path
    0 references
    reliability
    0 references
    recursive constraint
    0 references
    ranking quickest paths
    0 references

    Identifiers