离散优化问题中基于图的局部消去算法
Graph-based local elimination algorithms in discrete optimization
摘要：
本文的目的是提供一个结构分解方法在离散优化的审查，并给出一个统一的框架，在局部消除算法（LEA）的形式。本文的组织结构如下。考虑了带约束的离散优化问题的局部消去算法，给出了动态规划计算过程的分类。我们介绍了消除游戏和消除树。将约束满足（CS）的桶消元算法应用于求解DOP问题。我们考虑不同的本地消除计划和相关的概念。聚类将多个变量合并为单个元变量，定义了一种有前途的方法来解决DOP。这允许创建商（压缩）图并应用局部块消除算法。为了描述区块消除过程，我们引入区块消除游戏。我们讨论了上述局部消除算法方案的连接和一种将计算LEA过程的有向无环图（DAG）转化为树分解的方法。
英文摘要：
The aim of this paper is to provide a review of structural decomposition methods in discrete optimization and to give a unified framework in the form of local elimination algorithms (LEA). This paper is organized as follows. Local elimination algorithms for discrete optimization (DO) problems (DOPs) with constraints are considered; a classification of dynamic programming computational procedures is given. We introduce Elimination Game and Elimination tree. Application of bucket elimination algorithm from constraint satisfaction (CS) to solving DOPs is done. We consider different local elimination schemes and related notions. Clustering that merges several variables into single meta-variable defines a promising approach to solve DOPs. This allows to create a quotient (condensed) graph and apply a local block elimination algorithm. In order to describe a block elimination process, we introduce Block Elimination Game. We discuss the connection of aforementioned local elimination algorithmic schemes and a way of transforming the directed acyclic graph (DAG) of computational LEA procedure to the tree decomposition.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
