Approximating the Stochastic Network by its <i>M</i> Shortest Paths (Q3415944): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path algorithms: Taxonomy and annotation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Elmaghraby's “The Theory of Networks and Management Science” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating critical path and arc probabilities in stochastic activity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in networks with exponentially distributed arc lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network optimization: A bibliography / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0269964800001297 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2159914335 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:23, 30 July 2024

scientific article
Language Label Description Also known as
English
Approximating the Stochastic Network by its <i>M</i> Shortest Paths
scientific article

    Statements