17445

Автор(ы): 

Автор(ов): 

1

Параметры публикации

Тип публикации: 

Тезисы доклада

Название: 

Heuristic algorithm for optimal tree search

Наименование конференции: 

  • 25th Conference of the European Chapter on Combinatorial Optimization (ECCO'2012, Анталия, Турция)

Наименование источника: 

  • Abstracts of the 25th Conference of the European Chapter on Combinatorial Optimization (ECCO'2012, Antalya)

Город: 

  • Анталия

Издательство: 

  • Измирский экономический университет

Год издания: 

2012

Страницы: 

24-25
Аннотация
Many combinatorial problems reduce to the optimal tree problem (OTP) – that of minimizing a cost function over a set of rooted trees with given leaves. No polynomial (by the number of leaves) approximation for OTP exists, but lower-bound estimates (LBE) are developed for many special cases. We propose a polynomial heuristic algorithm that employs these LBE. It combines greedy top-down tree construction with local search and parameters adjustment. The algorithm was successfully applied to the problems of decision tree growing and user interface structure optimization.

Библиографическая ссылка: 

Губко М.В. Heuristic algorithm for optimal tree search / Abstracts of the 25th Conference of the European Chapter on Combinatorial Optimization (ECCO'2012, Antalya). Анталия: Измирский экономический университет, 2012. С. 24-25.