By analyzing the structural properties of the problem, we develop an efficient heuristic and propose search and branching rules to improve the branch and bound ...
In this paper, we consider a class of convex nonlinear knapsack problems in which all decision variables are integer and the objective and knapsack ...
In this paper, we consider a class of convex nonlinear knapsack problems in which all deci- sion variables are integer and the objective and knapsack ...
Oct 22, 2024 · In this paper, a unified algorithm is proposed for solving a class of convex separable nonlinear knapsack problems, which are characterized by ...
Abstract: In this paper, we consider a class of convex nonlinear knapsack problems in which all decision variables are integer and the objective and knapsack ...
Abstract. The Convex Hull Heuristic (CHH) is a heuristic for mixed- integer programming problems with a nonlinear objective function and linear constraints.
In this paper we present a survey of algorithms and applications for the nonlinear knapsack problem, also known as the nonlinear resource allocation problem.
People also ask
What is the knapsack problem in heuristic method?
What is the nonlinear knapsack problem?
Heuristic and Exact Solution Method for Convex nonlinear Knapsack Problem · Mathematics, Computer Science. Asia Pac. J. Oper. Res. · 2012.
Heuristics for the General Multiple Non-linear Knapsack Problem
www.sciencedirect.com › article › pii
We propose heuristic algorithms for the multiple non-linear knapsack problem with separable non-convex profit and weight functions.
Oct 22, 2024 · A mixed integer programming formulation for the problem is provided along with exact and heuristic solution methods. The exact algorithm uses ...