On a discrete nonlinear and nonseparable knapsack problem
From MaRDI portal
Publication:920849
DOI10.1016/0167-6377(90)90067-FzbMath0708.90079MaRDI QIDQ920849
Publication date: 1990
Published in: Operations Research Letters (Search for Journal in Brave)
branch-and-bound algorithm; quadratic knapsack problem; discrete nonlinear and nonseparable knapsack problems
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C60: Abstract computational complexity for mathematical programming problems
90C30: Nonlinear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Maximizing a class of submodular utility functions, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, Competitive facility location model with concave demand, Efficient solution approaches for a discrete multi-facility competitive interaction model, The nonlinear knapsack problem - algorithms and applications, On a nonseparable convex maximization problem with continuous Knapsack constraints
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for quadratic knapsack problems
- Solving certain singly constrained convex optimization problems in production planning
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- A polynomially bounded algorithm for a singly constrained quadratic program
