基于拓扑排序的最大生成树问题的全局偏好一致性
Global preferential consistency for the topological sorting-based maximal spanning tree problem
摘要:
我们介绍了一种新的完全可计算的问题,DSS专用于最大生成树问题,基于演绎和选择:优惠的一致性问题。为了显示其兴趣,我们描述了一个新的紧凑的表示特定于生成树的偏好,确定一个有效的最大生成树子问题。接下来,我们将这个问题与基于Pareto的多目标问题进行比较。最后,我们提出了一个有效的算法来解决相关的偏好一致性问题。
英文摘要:
We introduce a new type of fully computable problems, for DSS dedicated to maximal spanning tree problems, based on deduction and choice: preferential consistency problems. To show its interest, we describe a new compact representation of preferences specific to spanning trees, identifying an efficient maximal spanning tree sub-problem. Next, we compare this problem with the Pareto-based multiobjective one. And at last, we propose an efficient algorithm solving the associated preferential consistency problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。