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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6640292 / rank
 
Normal rank
Property / zbMATH Keywords
 
flows over time
Property / zbMATH Keywords: flows over time / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic networks
Property / zbMATH Keywords: dynamic networks / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2016.03.045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2405644299 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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