A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716)
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: A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs |
scientific article; zbMATH DE number 7552217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs |
scientific article; zbMATH DE number 7552217 |
Statements
A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (English)
0 references
1 July 2022
0 references
multiobjective optimization
0 references
maximum multiplicative programming
0 references
optimization over the efficient set
0 references
Nash social welfare
0 references
mixed integer programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8392397165298462
0 references
0.7918127179145813
0 references
0.7751758098602295
0 references
0.7643161416053772
0 references
0.760752260684967
0 references
