Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization

Rafael Pastor () and Albert Corominas

TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 2000, vol. 8, issue 1, 134 pages

Keywords: combinatorial optimization; branch and bound; artificial intelligence; 65K05; 65K10 (search for similar items in EconPapers)
Date: 2000
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/BF02564831 (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:8:y:2000:i:1:p:111-134

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

DOI: 10.1007/BF02564831

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 ().