Finding the \(K\) shortest paths in a schedule-based transit network (Q1761096): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.cor.2010.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048848130 / 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: Data Structures and Computer Science Techniques in Operations Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
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: Finding \(K\) shortest looping paths in a traffic-light network / 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: Deterministic network optimization: A bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modeling Framework for Passenger Assignment on a Transport Network with Timetables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the first \(K\) shortest paths in a time-window network. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Doubly Dynamic Schedule-based Assignment Model for Transit Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-shortest routing of trains on shunting yards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank

Latest revision as of 21:44, 5 July 2024

scientific article
Language Label Description Also known as
English
Finding the \(K\) shortest paths in a schedule-based transit network
scientific article

    Statements

    Finding the \(K\) shortest paths in a schedule-based transit network (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    \(K\) shortest paths
    0 references
    schedule-based transit network
    0 references
    generalized cost
    0 references
    time-window constraint
    0 references
    0 references