Variable ordering for decision diagrams: A portfolio approach
Variable ordering for decision diagrams: A portfolio approach
复制标题
决策图的变量排序:组合方法
DOI:
10.1007/s10601-021-09325-6
复制
发表时间:
2022
期刊:
影响因子:
1.6
通讯作者:
Willem-Jan van Hoeve
中科院分区:
文献类型:
--
作者:
Anthony Karahalios;Willem-Jan van Hoeve
Relaxed decision diagrams have been successfully applied to solve combinatorial optimization problems, but their performance is known to strongly depend on the variable ordering. We propose a portfolio approach to selecting the best ordering among a set of alternatives. We consider several different portfolio mechanisms: a static uniform time-sharing portfolio, an offline predictive model of the single best algorithm using classifiers, a low-knowledge algorithm selection, and a dynamic online time allocator. As a case study, we compare and contrast their performance on the graph coloring problem. We find that on this problem domain, the dynamic online time allocator provides the best overall performance.
影响因子:
6.3
作者:
J. Christopher Beck;Eugene C. Freuder
通讯作者:
Eugene C. Freuder
影响因子:
6.3
作者:
W. V. Hoeve
通讯作者:
W. V. Hoeve