A combinatorial approximation algorithm for supply chain network flow problem (Q884620)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5162008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial approximation algorithm for supply chain network flow problem |
scientific article; zbMATH DE number 5162008 |
Statements
A combinatorial approximation algorithm for supply chain network flow problem (English)
0 references
6 June 2007
0 references
A new combinatorial approximation algorithm for a supply chain network flow problem containing the manufacturers, retailers and consumers is developed. The algorithm is proposed with the application of simplicial decomposition to find the optimal proportions for current product flow and the minimum-cost flows while a tighter computation bound is achieved in decreasing the values of congestion and the potential function. Numerical calculations are carried out on a wide range of large-scale hypothetical supply chain networks.
0 references
supply chain network flow
0 references
combinatorial approximation algorithm
0 references
simplicial decomposition
0 references
minimum-cost flow
0 references
numerical examples
0 references
0.7898790240287781
0 references
0.7816079258918762
0 references
0.7697402834892273
0 references
0.7666292190551758
0 references
0.7512567043304443
0 references
