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 this page instead for the normal view: A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs |
scientific article; zbMATH DE number 6875822
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
