dal (ve) sınır yöntemi

listen to the pronunciation of dal (ve) sınır yöntemi
Türkçe - İngilizce
branch and bound
Branch and bound (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of fruitless candidates are discarded en masse, by using upper and lower estimated bounds of the quantity being optimized
dal (ve) sınır yöntemi