No label defined (Q4215031)
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 1217674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1217674 |
Statements
23 June 1999
0 references
multiple criteria linear cost network flow
0 references
multiple commodity flow
0 references
simplex method
0 references
0.9003790020942688
0 references
0.7965604662895203
0 references
0.7863238453865051
0 references
Recently \textit{G. Ruhe} [`Algorithmic aspects of flows in networks' (1991; Zbl 0746.90021)] developed another simplex method for solving a multiple criteria linear cost network flow problem. The aim of this paper is to consider a more general multiple criteria linear cost network flow model which includes the problem addressed by Ruhe as a special case. In addition, this model also includes two other important network flow problems as special cases, these are: (i) finding a feasible solution for the single criterion multiple commodity flow problems; (ii) solving the subproblem in a resource directive-decomposition method for multiple criteria multiple commodity flow problems. This general model will be formulated in Section 2, with the reduction of the general model to the special cases discussed in Section 3. A search algorithm for finding a feasible solution to the multiple commodity flow problem based on the multiple criteria model is presented in Section 4 with full justification. For the entire collection see [Zbl 0897.00034].
0 references