A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90126-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083957197 / rank | |||
Normal rank | |||
Revision as of 21:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangean heuristic for the capacitated concave minimum cost network flow problem |
scientific article |
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
