A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (Q5058729): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 21:38, 28 February 2024
scientific article; zbMATH DE number 7636604
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
