On finding dissimilar paths (Q1969851): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3056948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The discrete p-dispersion problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A comparison of \(p\)-dispersion heuristics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modeling of Transport Risk for Hazardous Materials / 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: On algorithms for finding the k shortest paths in a network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computingk-shortest path lengths in euclidean networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank | |||
Normal rank |
Latest revision as of 14:33, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On finding dissimilar paths |
scientific article |
Statements
On finding dissimilar paths (English)
0 references
19 March 2000
0 references
transportation planning
0 references
path selection
0 references
dangerous goods
0 references
heuristics
0 references
risk management
0 references