A zero-space algorithm for negative cost cycle detection in networks (Q2466006)
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 5225236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A zero-space algorithm for negative cost cycle detection in networks |
scientific article; zbMATH DE number 5225236 |
Statements
A zero-space algorithm for negative cost cycle detection in networks (English)
0 references
11 January 2008
0 references
negative cost cycles
0 references
polyhedra
0 references
difference constraints
0 references
stressing
0 references
relaxing
0 references
zero-space
0 references
shortest paths
0 references
0 references
0.8803904056549072
0 references
0.8747180104255676
0 references
0.82207852602005
0 references
0.8082988858222961
0 references
0.8082904815673828
0 references
