Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(99)00005-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1984751469 / rank | |||
Normal rank | |||
Latest revision as of 10:47, 30 July 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
0 references
