Some special synthesis problems for multiproduct networks (Q2563385)
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 957042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some special synthesis problems for multiproduct networks |
scientific article; zbMATH DE number 957042 |
Statements
Some special synthesis problems for multiproduct networks (English)
0 references
11 December 1996
0 references
This work treats two multiproduct problems in a network. The first one is related to defining the product flow if the maximal flow is known. In the second one the resource distribution cost is minimized if a certain demand is satisfied. Also the case when the second problem can be reduced to a set of single-product problems is discussed.
0 references
multiproduct problem
0 references
network
0 references
network flow
0 references
distribution cost
0 references
0.833245038986206
0 references
0.7969145178794861
0 references
0.7822787761688232
0 references
0.7731382250785828
0 references
