Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems
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 ge...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2004 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/6057 |
| Acceso en línea: | https://hdl.handle.net/2117/6057 |
| Access Level: | acceso abierto |
| Palabra clave: | Combinatorial optimization Branch and bound Artificial intelligence Optimización combinatoria Optimització combinatòria Inteligencia artificial Intel·ligència artificial Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions |
| Sumario: | 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. |
|---|