Integer quadratic knapsack problems
From MaRDI portal
Recommendations
- Exact solution methods for the k-item quadratic knapsack problem
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- New algorithm for quadratic integer knapsack problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- Improving an exact approach for solving separable integer quadratic knapsack problems
Cited in
(12)- A computational study on the quadratic knapsack problem with multiple constraints
- Quadratic bottleneck knapsack problems
- Exact solution methods for the k-item quadratic knapsack problem
- New algorithm for quadratic integer knapsack problems
- A Closed-Form Solution To A Class Of Quadratic Knapsack Problems
- Improving an exact approach for solving separable integer quadratic knapsack problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Projection Method for the Integer Quadratic Knapsack Problem
- The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
- Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs
- Integer knapsack problems with profit functions of the same value range
- Global optimality conditions and optimization methods for quadratic knapsack problems
This page was built for publication: Integer quadratic knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059316)