New formulation and relaxation to solve a concave-cost network flow problem (Q4367015)
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: New formulation and relaxation to solve a concave-cost network flow problem |
scientific article; zbMATH DE number 1091228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New formulation and relaxation to solve a concave-cost network flow problem |
scientific article; zbMATH DE number 1091228 |
Statements
New formulation and relaxation to solve a concave-cost network flow problem (English)
0 references
6 July 1998
0 references
capacity selection
0 references
heuristic
0 references
nonlinear cost
0 references
minimum cost, multicommodity network flow
0 references
Lagrangian relaxations
0 references
0.8561524748802185
0 references
0.8446805477142334
0 references
0.8191478848457336
0 references
