A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (Q5058729): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A new upper bound for the 0-1 quadratic knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Validation of subgradient optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The quadratic knapsack problem -- a survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving wind farm layout optimization with mixed integer programs and constraint programs / rank | |||
Normal rank | |||
Latest revision as of 04:35, 31 July 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
