You are not currently logged in.
Access JSTOR through your library or other institution:
Optimum Seeking with Branch and Bound
Vol. 13, No. 4, Series B, Managerial (Dec., 1966), pp. B176-B185
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/2627549
Page Count: 10
You can always find the topics here!Topics: Optimal solutions, Scheduling, Job shops, Objective functions, Tours, Mathematical problems, Integers, Mathematical minima, Algorithms, Operations research
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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 © 1966 INFORMS