A branch and search algorithm for a class of nonlinear knapsack problems
From MaRDI portal
Publication:594771
DOI10.1016/0167-6377(83)90047-0zbMath0526.90066OpenAlexW2055498515MaRDI QIDQ594771
Harvey M. Salkin, Kamlesh Mathur, Morito, Susumu
Publication date: 1983
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(83)90047-0
reductionquadratic objective functionefficient algorithmbranch and search procedurecapital budgetingcontinuous (relaxed) solutionnonlinear knapsack problemstight lower and upper bounds
Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20)
Related Items
A new exact algorithm for concave knapsack problems with integer variables, A note on a general nonlinear knapsack problem, Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems, Exact solution method to solve large scale integer quadratic multidimensional knapsack problems, A nonlinear knapsack problem, A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem, A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism, Quadratic resource allocation with generalized upper bounds, A hybrid method for solving nonlinear knapsack problems, Two backtrack algorithms for the ratio frequency intermodulation problem, A general purpose exact solution method for mixed integer concave minimization problems, Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution, Improving an exact approach for solving separable integer quadratic knapsack problems, An exact algorithm for linear integer programming problems with distributionally robust chance constraints, Allocation of discrete resource in order transmission hierarchical organization, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, A survey on the continuous nonlinear resource allocation problem, Solving knapsack problems with \(S\)-curve return functions, A simple procedure for solving a continuous quadratic mathematical model., An exact penalty function approach for nonlinear integer programming problems, 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, A branch-and-bound algorithm for the quadratic multiple knapsack problem, Inverse optimization for linearly constrained convex separable programming problems, An approximate dynamic programming approach to convex quadratic knapsack problems, A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals, The nonlinear knapsack problem - algorithms and applications, Exact algorithm for concave knapsack problems: linear underestimation and partition method, Exact solution of a class of nonlinear knapsack problems
Cites Work
