Efficient Methods For Solving Quadratic 0–1 Knapsack Problems

DOI10.1080/03155986.1997.11732327MaRDI QIDQ4372880zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

heuristicbranch and boundlinear inequality\(L_ 2\)-best linear approximation

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

Recommendations

• Linear programming for the \(0-1\) quadratic knapsack problem
• 0-1 quadratic knapsack problems: an exact approach based on a t-linearization
• Exact Solution of the Quadratic Knapsack Problem
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem

Cited in

(29)

• Upper bounds and exact algorithms for \(p\)-dispersion problems
• The polynomial robust knapsack problem
• Solution of large quadratic knapsack problems through aggressive reduction
• On reduction of duality gap in quadratic knapsack problems
• Simple solution methods for separable mixed linear and quadratic knapsack problem
• A note on optimal solutions to quadratic knapsack problems
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• scientific article; zbMATH DE number 1795719 (Why is no real title available?)
• 0-1 quadratic knapsack problems: an exact approach based on a t-linearization
• A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• A two-phase method for solving continuous rank-one quadratic knapsack problems
• Quadratic bottleneck knapsack problems
• Global optimality conditions and optimization methods for quadratic knapsack problems
• An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
• An O(n) algorithm for quadratic knapsack problems
• 0-1 quadratic knapsack problem solved with VNS algorithm
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• The nonlinear knapsack problem - algorithms and applications
• A new upper bound for the 0-1 quadratic knapsack problem
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
• The quadratic knapsack problem -- a survey
• The quadratic 0-1 knapsack problem with series-parallel support
• A conic approximation method for the 0-1 quadratic knapsack problem
• The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem
• The quadratic knapsack problem
• On a nonseparable convex maximization problem with continuous Knapsack constraints
• A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems

This page was built for publication: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372880)