Simple solution methods for separable mixed linear and quadratic knapsack problem

摘要: Abstract Quadratic knapsack problem has a central role in integer and nonlinear optimization, which been intensively studied due to its immediate applications many fields theoretical reasons. Although quadratic can be solved using traditional optimization methods, specialized algorithms are much faster more reliable than the programming solvers. In this paper, we study mixed linear with convex separable objective function subject single constraint box constraints. We investigate structural properties of problem, develop simple method for solving continuous version based on bi-section search, then present heuristics problem. Numerical experiments conducted show effectiveness proposed solution methods by comparing our some state art