Methodology for Stochastic Graph Completion-Time Problems (Q4367048)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1091259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Methodology for Stochastic Graph Completion-Time Problems |
scientific article; zbMATH DE number 1091259 |
Statements
Methodology for Stochastic Graph Completion-Time Problems (English)
0 references
5 April 1998
0 references
stochastic graph completion-time problems
0 references
\(k\)-opt heuristics
0 references
stochastic shortest path
0 references
traveling salesman
0 references
0.8918446
0 references
0.8796887
0 references
0.87810147
0 references
0.8703621
0 references
0.8701973
0 references
