Bicriteria network flow problems: Continuous case (Q1175771): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0377-2217(91)90151-k / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2094079836 / rank | |||
Normal rank |
Latest revision as of 10:59, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bicriteria network flow problems: Continuous case |
scientific article |
Statements
Bicriteria network flow problems: Continuous case (English)
0 references
25 June 1992
0 references
An algorithm to solve bicriteria network flow problems with continuous variables is developed. First, an efficient extreme point is determined using the out-of-kilter method. Then, adjacent extreme points in the objective space are determined. A simple example is given. Possible extensions are discussed.
0 references
bicriteria network flow
0 references
out-of-kilter method
0 references
0 references
0 references