Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Applying steepest-edge techniques to a network primal-dual algorithm |
scientific article; zbMATH DE number 1045746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applying steepest-edge techniques to a network primal-dual algorithm |
scientific article; zbMATH DE number 1045746 |
Statements
Applying steepest-edge techniques to a network primal-dual algorithm (English)
0 references
7 August 1997
0 references
steepest-edge criteria
0 references
primal-dual algorithm
0 references
minimum cost network flow
0 references
0 references
0.8404671549797058
0 references
0.7856351733207703
0 references
0.7751350402832031
0 references
0.7666028141975403
0 references
