The shortest path with at most / nodes in each of the series/parallel clusters (Q4894863)
From MaRDI portal
scientific article; zbMATH DE number 932506
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The shortest path with at most / nodes in each of the series/parallel clusters |
scientific article; zbMATH DE number 932506 |
Statements
The shortest path with at most / nodes in each of the series/parallel clusters (English)
0 references
13 November 1996
0 references
constrained shortest path problems
0 references
