Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
From MaRDI portal
Publication:2892339
DOI10.1287/ijoc.1050.0172zbMath1241.90119WikidataQ58826434 ScholiaQ58826434MaRDI QIDQ2892339
W. David Pisinger, Anders Bo Rasmussen, Rune Sandvik
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1050.0172
90C06: Large-scale problems in mathematical programming
90C20: Quadratic programming
90C27: Combinatorial optimization
Related Items
Asymptotic behavior of the quadratic knapsack problem, Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach, Exact solution method to solve large scale integer quadratic multidimensional knapsack problems, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, 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, 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 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, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem
Uses Software
