A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510)
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 6875822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs |
scientific article; zbMATH DE number 6875822 |
Statements
A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (English)
0 references
29 May 2018
0 references
multi-objective
0 references
convex mixed integer non-linear programming
0 references
heuristic algorithm
0 references
hydro unit commitment
0 references
knapsack problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8057451248168945
0 references
0.7882593870162964
0 references
0.7832723259925842
0 references
0.7706050872802734
0 references
0.7677044868469238
0 references
