Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
From MaRDI portal
Publication:2890419
DOI10.1287/ijoc.1030.0029zbMath1239.90075OpenAlexW2141494354MaRDI QIDQ2890419
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1030.0029
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Boolean programming (90C09)
Related Items (18)
Dual mean field search for large scale linear and quadratic knapsack problems ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem ⋮ Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering ⋮ Dual mean field annealing scheme for binary optimization under linear constraints ⋮ A cut-and-branch algorithm for the quadratic knapsack problem ⋮ A lifted-space dynamic programming algorithm for the quadratic knapsack problem ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations ⋮ Conference scheduling: a clustering-based approach ⋮ A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem ⋮ A matheuristic for the 0--1 generalized quadratic multiple knapsack problem ⋮ A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
This page was built for publication: Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
