It is a general algorithmic method for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It belongs to the class of implicit enumeration methods. The method was first proposed by A. H. Land and A. G. Doig in 1960 for linear programming.†
References:
†Branch and bound - Wikipedia, the free encyclopedia, last modified 19:36, 14 December 2005, http://en.wikipedia.org/wiki/Branch_and_bound
Related Posts:
Some other Optimisation methods
© 2006 Kumaravel & Project Team
No comments :
Post a Comment
Blog authors can delete the comment if it contains the inappropriate contents.