A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problems |
| |
Authors: | Frank Körner |
| |
Institution: | (1) Stolpener Str. 9, 8512 Großröhrsdorf, GDR |
| |
Abstract: | We examine a branch and bound algorithm for solving nonlinear (convex) integer programming problems. In this note we generalize previous results for the quadratic case. The variables are branched in such a way that the number of branch and bound nodes checked in the process is small. Numerical results confirm the efficiency. |
| |
Keywords: | primary: 90C09 secondary: 65K 10 |
本文献已被 SpringerLink 等数据库收录! |