A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization

DOI10.1080/0305215X.2017.1316844MaRDI QIDQ5058729

Ning Quan, Harrison M. Kim

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

zbMATH Keywords

upper boundgreedy algorithmmixed integer programminglayout optimizationquadratic knapsack problemwind farm

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Greedy robust wind farm layout optimization with feasibility guarantee

Uses Software

• Knapsack

Cites Work

• The quadratic knapsack problem -- a survey
• A new upper bound for the 0-1 quadratic knapsack problem
• Solving wind farm layout optimization with mixed integer programs and constraint programs
• Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
• An analysis of approximations for maximizing submodular set functions—I
• Exact Solution of the Quadratic Knapsack Problem
• Validation of subgradient optimization

This page was built for publication: A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization