Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Shortest path problems with partial information: Models and algorithms for detecting dominance |
scientific article; zbMATH DE number 1417480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Shortest path problems with partial information: Models and algorithms for detecting dominance |
scientific article; zbMATH DE number 1417480 |
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
0 references
