A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012)
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: A minimum mean cycle cancelling method for nonlinear multicommodity flow problems |
scientific article; zbMATH DE number 1423594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimum mean cycle cancelling method for nonlinear multicommodity flow problems |
scientific article; zbMATH DE number 1423594 |
Statements
A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (English)
0 references
20 November 2000
0 references
network programming
0 references
separable convex programming
0 references
minimum mean cycle cancelling
0 references
multicommodity flow
0 references
message routing
0 references
telecommunication networks
0 references
0 references
0 references
0 references
0.8373967409133911
0 references
0.8298332691192627
0 references
0.8138056397438049
0 references
0.8138056397438049
0 references
0.8074391484260559
0 references
