A hybrid method for solving nonlinear knapsack problems

A hybrid method for solving nonlinear knapsack problems

0.00 Avg rating0 Votes
Article ID: iaor1989326
Country: Netherlands
Volume: 38
Issue: 2
Start Page Number: 238
End Page Number: 241
Publication Date: Jan 1989
Journal: European Journal of Operational Research
Authors:
Keywords: programming: nonlinear
Abstract:

This paper discusses a hybrid method for solving separable nonlinear integer programming problems. With the subgradient algorithm it determines a surrogate problem. This problem is solved by dynamic programming. The paper obtains sharp and simple computable bounds for the branch and bound process of solving the original problem.

Reviews

Required fields are marked *. Your email address will not be published.