The approach‐dependent, time‐dependent, label‐constrained shortest path problem (Q5487812): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TRANSIMS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20120 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4234243195 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3292915 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:59, 24 June 2024
scientific article; zbMATH DE number 5052636
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The approach‐dependent, time‐dependent, label‐constrained shortest path problem |
scientific article; zbMATH DE number 5052636 |
Statements
The approach‐dependent, time‐dependent, label‐constrained shortest path problem (English)
0 references
12 September 2006
0 references
shortest path problems
0 references
approach dependent
0 references
time dependent
0 references
label constraints
0 references
TRANSIMS
0 references
