Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57641296, #quickstatements; #temporary_batch_1704806754709 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:38, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path problems with partial information: Models and algorithms for detecting dominance |
scientific article |
Statements
Shortest path problems with partial information: Models and algorithms for detecting dominance (English)
0 references
19 March 2000
0 references
network programming
0 references
partial information
0 references
multicriteria analysis
0 references
