|
|||||
|
|
A branch and bound algorithm for solving a class of nonlinear integer programming problems |
|
| Authors: | A Victor Cabot S Selcuk Erenguc |
| Abstract: | This article presents a branch and bound method for solving the problem of minimizing a separable concave function over a convex polyhedral set where the variables are restricted to be integer valued. Computational results are reported. |
| Keywords: | |