Exact methods for solving the elementary shortest and longest path problems (Q512936)
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 6691214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact methods for solving the elementary shortest and longest path problems |
scientific article; zbMATH DE number 6691214 |
Statements
Exact methods for solving the elementary shortest and longest path problems (English)
0 references
3 March 2017
0 references
elementary shortest path
0 references
elementary longest path
0 references
negative cycles
0 references
mixed integer programming
0 references
decomposition
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8194842338562012
0 references
0.797606885433197
0 references
0.7901089787483215
0 references
0.7855703234672546
0 references
0.7571877837181091
0 references
