Approximate solutions of capacitated fixed-charge minimum cost network flow problems (Q3984287)
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: Approximate solutions of capacitated fixed-charge minimum cost network flow problems |
scientific article; zbMATH DE number 25959
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate solutions of capacitated fixed-charge minimum cost network flow problems |
scientific article; zbMATH DE number 25959 |
Statements
Approximate solutions of capacitated fixed-charge minimum cost network flow problems (English)
0 references
27 June 1992
0 references
capacitated, single-commodity fixed-charge network flow
0 references
lower bounding algorithm
0 references
heuristic
0 references
minimum spanning tree
0 references
