Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
From MaRDI portal
Publication:4372880
DOI10.1080/03155986.1997.11732327zbMath0888.90121OpenAlexW2401096565MaRDI QIDQ4372880
Peter L. Hammer, David J. jun. Rader
Publication date: 8 June 1998
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1997.11732327
Related Items (18)
Quadratic bottleneck knapsack problems ⋮ 0-1 quadratic knapsack problem solved with VNS algorithm ⋮ On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ The quadratic knapsack problem -- a survey ⋮ Global optimality conditions and optimization methods for quadratic knapsack problems ⋮ On reduction of duality gap in quadratic knapsack problems ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems ⋮ A new upper bound for the 0-1 quadratic knapsack problem ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ The polynomial robust knapsack problem ⋮ Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems ⋮ The quadratic 0-1 knapsack problem with series-parallel support
This page was built for publication: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
