Heuristic solutions for general concave minimum cost network flow problems (Q3593371)
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: Heuristic solutions for general concave minimum cost network flow problems |
scientific article; zbMATH DE number 5173298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic solutions for general concave minimum cost network flow problems |
scientific article; zbMATH DE number 5173298 |
Statements
Heuristic solutions for general concave minimum cost network flow problems (English)
0 references
20 July 2007
0 references
network flow
0 references
heuristics
0 references
genetic algorithms
0 references
local search
0 references
concave-cost optimization
0 references
combinatorial optimization
0 references
0.8564572334289551
0 references
0.8374682664871216
0 references
0.8360737562179565
0 references
0.8306537866592407
0 references
