A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
From MaRDI portal
Publication:5058729
Recommendations
- Solving wind farm layout optimization with mixed integer programs and constraint programs
- Solving wind farm layout optimization with mixed integer programming and constraint programming
- Greedy robust wind farm layout optimization with feasibility guarantee
- Wind farm portfolio optimization under network capacity constraints
- Upper bounds for large scale integer quadratic multidimensional knapsack problems
- A semidefinite programming approach to the quadratic knapsack problem
- An approximate dynamic programming approach to convex quadratic knapsack problems
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- A note on optimal solutions to quadratic knapsack problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
Cites work
- A new upper bound for the 0-1 quadratic knapsack problem
- An analysis of approximations for maximizing submodular set functions—I
- Exact Solution of the Quadratic Knapsack Problem
- Solution of large quadratic knapsack problems through aggressive reduction
- Solving wind farm layout optimization with mixed integer programs and constraint programs
- The quadratic knapsack problem -- a survey
- Validation of subgradient optimization
Cited in
(2)
This page was built for publication: A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058729)
