A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087): 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/j.ejor.2005.03.024 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2008401418 / rank | |||
Normal rank |
Revision as of 01:02, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems |
scientific article |
Statements
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (English)
0 references
13 September 2006
0 references
network flows
0 references
dynamic programming
0 references
concave-cost optimization
0 references
global optimization
0 references
combinatorial optimization
0 references