A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (Q5058729)
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 tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization |
scientific article; zbMATH DE number 7636604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization |
scientific article; zbMATH DE number 7636604 |
Statements
A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (English)
0 references
23 December 2022
0 references
wind farm
0 references
layout optimization
0 references
mixed integer programming
0 references
quadratic knapsack problem
0 references
upper bound
0 references
greedy algorithm
0 references
0.8801629
0 references
0.8767267
0 references
0.8695549
0 references
0.82760745
0 references
0.8249505
0 references
0.81645304
0 references
0.81344897
0 references
0.80996263
0 references
0.8098353
0 references
