A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992)
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 Lagrangean heuristic for the capacitated concave minimum cost network flow problem |
scientific article; zbMATH DE number 709899
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangean heuristic for the capacitated concave minimum cost network flow problem |
scientific article; zbMATH DE number 709899 |
Statements
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (English)
0 references
11 January 1995
0 references
heuristic
0 references
capacitated concave minimum cost network flow
0 references
Lagrangean dualization
0 references
subgradient search
0 references
lower bound
0 references
0 references
0.9377965
0 references
0.9314421
0 references
0.9256983
0 references
0.9165976
0 references
0.91266227
0 references
0.9102618
0 references
