Minimizing a linear multiplicative-type function under network flow constraints (Q1362518)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing a linear multiplicative-type function under network flow constraints |
scientific article; zbMATH DE number 1043997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing a linear multiplicative-type function under network flow constraints |
scientific article; zbMATH DE number 1043997 |
Statements
Minimizing a linear multiplicative-type function under network flow constraints (English)
0 references
5 August 1997
0 references
bicriteria decision making
0 references
nonconvex network flow
0 references
product of two affine functions
0 references
primal-dual algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0.785285472869873
0 references
0.7833227515220642
0 references
