Finding \(K\) shortest looping paths in a traffic-light network (Q1886860): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling School Buses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quickest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path algorithms: Taxonomy and annotation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network optimization: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of travel time and weighted number of stops in a traffic-light network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for K shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267389 / 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: Data Structures and Computer Science Techniques in Operations Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for ranking paths that may contain cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the ranking of shortest paths / rank
 
Normal rank

Latest revision as of 15:29, 7 June 2024

scientific article
Language Label Description Also known as
English
Finding \(K\) shortest looping paths in a traffic-light network
scientific article

    Statements

    Finding \(K\) shortest looping paths in a traffic-light network (English)
    0 references
    0 references
    0 references
    19 November 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Shortest path
    0 references
    Traffic-light
    0 references
    Looping path
    0 references
    0 references