PublisherSociedad Española de Estadística e Investigación Operativa
Rights accessOpen Access
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.
CitationPastor, R.; Corominas, A. "Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems". Top. Revista de la Sociedad de Estadística e Investigación Operativa, 2004, Vol. 12, No. 1, p. 169-191.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com