Branch and win: OR tree search algorithms for solving combinatorial optimisation problems

Rafael Pastor () and Albert Corominas ()

TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 2004, vol. 12, issue 1, 169-191

Keywords: Combinatorial optimization; branch and bound; artificial intelligence; 90C27; 90C57; 68T20 (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/BF02578930 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:topjnl:v:12:y:2004:i:1:p:169-191

Ordering information: This journal article can be ordered from
http://link.springer.de/orders.htm

DOI: 10.1007/BF02578930

Access Statistics for this article

TOP: An Official Journal of the Spanish Society of Statistics and Operations Research is currently edited by Juan José Salazar González and Gustavo Bergantiños

More articles in TOP: An Official Journal of the Spanish Society of Statistics and Operations Research from Springer, Sociedad de Estadística e Investigación Operativa
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().