Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
From MaRDI portal
Publication:2892339
DOI10.1287/ijoc.1050.0172zbMath1241.90119OpenAlexW1971967801WikidataQ58826434 ScholiaQ58826434MaRDI QIDQ2892339
Rune Sandvik, Anders Bo Rasmussen, W. David Pisinger
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
Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Combinatorial optimization (90C27)
Related Items (28)
A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming ⋮ Dantzig-Wolfe reformulations for binary quadratic problems ⋮ On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ Exact solution method to solve large scale integer quadratic multidimensional knapsack problems ⋮ A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Asymptotic behavior of the quadratic knapsack problem ⋮ Approximation of the Quadratic Knapsack Problem ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ On the product knapsack problem ⋮ A Branch-and-Bound Algorithm for Team Formation on Social Networks ⋮ A cut-and-branch algorithm for the quadratic knapsack problem ⋮ A lifted-space dynamic programming algorithm for the quadratic knapsack problem ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ A Dynamic Programming Heuristic for the Quadratic Knapsack Problem ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ A computational study on the quadratic knapsack problem with multiple constraints ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem ⋮ Optimizing a polyhedral-semidefinite relaxation of completely positive programs ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem ⋮ An aggressive reduction scheme for the simple plant location problem ⋮ Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach ⋮ Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem ⋮ The polynomial robust knapsack problem ⋮ A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
Uses Software
This page was built for publication: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
