On a discrete nonlinear and nonseparable knapsack problem

DOI10.1016/0167-6377(90)90067-FzbMath0708.90079OpenAlexW1983893760MaRDI QIDQ920849

Theodore D. Klastorin

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90067-f

zbMATH Keywords

branch-and-bound algorithmquadratic knapsack problemdiscrete nonlinear and nonseparable knapsack problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (12)

On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning ⋮ Competitive facility location model with concave demand ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ Maximizing a class of submodular utility functions with constraints ⋮ Maximizing a class of submodular utility functions ⋮ Maximizing expected utility over a knapsack constraint ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ Efficient solution approaches for a discrete multi-facility competitive interaction model ⋮ Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem ⋮ Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems ⋮ The nonlinear knapsack problem - algorithms and applications

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

This page was built for publication: On a discrete nonlinear and nonseparable knapsack problem