Article ID: | iaor2005689 |
Country: | Spain |
Volume: | 12 |
Issue: | 1 |
Start Page Number: | 169 |
End Page Number: | 191 |
Publication Date: | Jun 2004 |
Journal: | TOP |
Authors: | Corominas A., Pastor B. |
Keywords: | optimization, programming: branch and bound |
Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search procedures that have been presented in the literature of operations research as well as in that of artificial intelligence. Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement the procedure.