An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757)
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 5192447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints |
scientific article; zbMATH DE number 5192447 |
Statements
An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (English)
0 references
19 September 2007
0 references
graph method decomposition
0 references
network
0 references
numerical examples
0 references
graph method decomposition technique
0 references
algorithm
0 references
nonlinear multi-commodity network flow problems
0 references
modified successive projection and truncated technique
0 references
successive quadratic programming method
0 references
dual projected pseudo-quasi-Newton method
0 references
0 references
0.8426851
0 references
0.83377415
0 references
0.83377415
0 references
0.8322214
0 references
0.82956177
0 references
0.8290108
0 references
0.82843983
0 references
0.82515305
0 references
0.8248513
0 references
