A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068)
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 branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach |
scientific article; zbMATH DE number 6988109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach |
scientific article; zbMATH DE number 6988109 |
Statements
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (English)
0 references
3 December 2018
0 references
multiplicative programming
0 references
multi-objective optimization
0 references
optimization over the efficient set
0 references
linear programming
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8027620315551758
0 references
0.7843837738037109
0 references
0.778832197189331
0 references
0.7711814641952515
0 references
