In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - that is the use of branch and bound to handle discrete constructs, which, while often formally representable in terms of zero-one integer variables, can be handled more elegantly and effectively by applying branch and bound to the actual dichotomies in the model. Keywords Branch and bound, Special Ordered Sets, Integer Programming
John J. H. Forrest, John A. Tomlin