Approximate solutions of capacitated fixed-charge minimum cost network flow problems (Q3984287): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3678942 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040221 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Latest revision as of 14:04, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate solutions of capacitated fixed-charge minimum cost network flow problems |
scientific article |
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
