Optimum Seeking with Branch and Bound

A wide variety of branch and bound algorithms have recently been described in the literature. This paper provides a generalized description of such algorithms. An objective is to demonstrate the wide applicability of branch and bound to combinatorial problems in general. Two existing algorithms are used as illustrations and a discussion of computational efficiency is included.

• 저널Management Science · 13(4) · B–176
• 토픽Optimization and Search Problems · Computer Networks and Communications
• DOI10.1287/mnsc.13.4.b176
• 저자Norman Agin