The design of branch and bound algorithms for a class of nonlinear integer programs
| Autor: | D. C. Myers, Hanif D. Sherali |
|---|---|
| Rok vydání: | 1986 |
| Předmět: | |
| Zdroj: | Annals of Operations Research. 5:463-484 |
| ISSN: | 1572-9338 0254-5330 |
| Popis: | This paper is concerned with computational experimentation leading to the design of effective branch and bound algorithms for an important class of nonlinear integer programming problems, namely linearly constrained problems, which are used to model several real-world situations. The main contribution here is a study of the effect of node and branching variable selection and storage reduction strategies on overall computational effort for this class of problems, as well as the generation of a set of adequate test problems. Several node and branching variable strategies are compared in the context of a pure breadth-first enumeration, as well as in a special breadth and depth enumeration combination approach presented herein. Also, the effect of using updated pseudocosts is briefly addressed. Computational experience is presented on a set of eighteen suitably-sized nonlinear test problems, as well as on some random linear integer programs. Some of the new rules proposed are demonstrated to be significantly superior to previously suggested strategies; interestingly, even for linear integer programming problems. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|