An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems (Q4377576)
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 1116328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems |
scientific article; zbMATH DE number 1116328 |
Statements
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems (English)
0 references
10 February 1998
0 references
network optimization
0 references
\(\epsilon\)-relaxation
0 references
network flows
0 references
0.9488124847412108
0 references
0.9335044622421264
0 references
0.9335044622421264
0 references
