Solution of large quadratic knapsack problems through aggressive reduction
From MaRDI portal
Recommendations
- Exact Solution of the Quadratic Knapsack Problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- The quadratic knapsack problem -- a survey
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
Cited in
(39)- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- On the product knapsack problem
- A computational study on the quadratic knapsack problem with multiple constraints
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- The polynomial robust knapsack problem
- Dantzig-Wolfe reformulations for binary quadratic problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- An aggressive reduction scheme for the simple plant location problem
- A cut-and-branch algorithm for the quadratic knapsack problem
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
- A dynamic programming heuristic for the quadratic knapsack problem
- Approximation of the quadratic knapsack problem
- Asymptotic behavior of the quadratic knapsack problem
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- Exact Solution of the Quadratic Knapsack Problem
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- Efficient presolving methods for solving maximal covering and partial set covering location problems
- Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
- Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams
- The quadratic knapsack problem
- A 3-space dynamic programming heuristic for the cubic knapsack problem
- The quadratic knapsack problem with setup
- A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
- A novel dynamic programming heuristic for the quadratic knapsack problem
- A nonparametric robust optimization approach for chance-constrained knapsack problem
- Computational experience with a core-based reduction procedure for the 2-knapsack problem
- Efficient local and tabu search strategies for large-scale general quadratic integer programming
- Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
This page was built for publication: Solution of large quadratic knapsack problems through aggressive reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892339)
