A note on a general nonlinear knapsack problem
From MaRDI portal
Publication:1081534
DOI10.1016/0167-6377(86)90107-0zbMath0601.90114OpenAlexW2092883909MaRDI QIDQ1081534
Bidhu B. Mohanty, Harvey M. Salkin, Kamlesh Mathur
Publication date: 1986
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(86)90107-0
lower and upper boundsimplicit enumerationconcave objective functioncontinuous (relaxed) solutiongeneral nonlinear knapsack problemsingle convex constraint
Related Items (12)
On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ A particle swarm optimization approach to the nonlinear resource allocation problem ⋮ A heuristic algorithm for a chance constrained stochastic program ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Nonconvex piecewise linear knapsack problems ⋮ Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method ⋮ Nonlinear integer programming for optimal allocation in stratified sampling
Cites Work
This page was built for publication: A note on a general nonlinear knapsack problem
