An improved branch and bound algorithm for mixed integer nonlinear programs (1994)
| Venue: | Computers and Operations Research |
| Citations: | 27 - 2 self |
BibTeX
@ARTICLE{Borchers94animproved,
author = {Brian Borchers and John E. Mitchell},
title = {An improved branch and bound algorithm for mixed integer nonlinear programs},
journal = {Computers and Operations Research},
year = {1994},
volume = {21},
pages = {359--367}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This report describes a branch and bound code for zero{one mixedinteger nonlinear programs with convex objective functions and constraints. The code uses heuristics to detect subproblems which donothave integral solutions. When the code detects such a subproblem, it creates two new subproblems instead of solving the current problem to optimality. Computational results on sample problems show that these heuristics can signi cantly decrease solution times for some problems.
Citations
No citations identified.
