Polynomial auction algorithms for shortest paths (Q1804574)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 755301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial auction algorithms for shortest paths |
scientific article; zbMATH DE number 755301 |
Statements
Polynomial auction algorithms for shortest paths (English)
0 references
11 June 1995
0 references
shortest path
0 references
network optimization
0 references
strongly polynomial variations
0 references
auction algorithm
0 references
0.8885360360145569
0 references
0.8683215379714966
0 references
0.8409543037414551
0 references
0.8248915076255798
0 references
0.7994945049285889
0 references
