Minimum cost paths over dynamic networks (Q325482): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Projected Perspective Reformulations with Applications in Design Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic shortest path problems with time-varying costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-cost dynamic flows: The series-parallel case / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results for time-constrained dynamical optimal path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the optimal value function in time-dependent networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. / 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

Revision as of 17:42, 12 July 2024

scientific article
Language Label Description Also known as
English
Minimum cost paths over dynamic networks
scientific article

    Statements

    Identifiers