Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57641296, #quickstatements; #temporary_batch_1704806754709 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57641296 / rank | |||
Normal rank | |||
Revision as of 14:33, 9 January 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
