arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.07326cs.DScs.CCcs.DMmath.COmath.OC
收藏

多类型单调幺半群优化及其应用

Multitype Integer Monoid Optimization and Applications

Dušan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn

摘要:

自从Gilmore和Gomory [Oper.结果:1961年]。配置IP对每个可能的配置都有一个变量,它描述了物品在某个位置的放置,其值对应于具有该放置的位置的数量。在高多重性问题中,项目有多种类型,并由多重性向量简洁地表示;求解配置IP相当于决定每种类型项目的多重性输入向量是否可以分解为给定数量的配置。我们通过观察可分解为配置的所有输入向量的集合形成幺半群来明确这个隐含的概念,并且解决配置IP是幺半群分解问题。受应用的启发,我们从两个方面丰富了这个问题。首先,有时每个配置另外具有目标值,产生在给定目标下找到“最佳”分解的优化问题。其次,对于不同类型的位置,通常存在不同类型的配置。由此产生的问题是优化输入多重性向量分解为几种类型的配置,我们称之为多类型单调优化,或MIMO。我们开发了快速精确的算法,用于各种MIMO,具有很少或许多位置类型和各种目标。我们的算法建立在一个新的邻近定理连接的解决方案,一定的配置IP的连续松弛。然后,我们投几个基本的调度和装箱问题的MIMO,从而获得新的或更快的算法。我们补充我们的积极的算法结果的硬度结果。

英文摘要:

Configuration integer programs (IP) have been key in the design of algorithms for NP-hard high-multiplicity problems since the pioneering work of Gilmore and Gomory [Oper. Res., 1961]. Configuration IPs have a variable for each possible configuration, which describes a placement of items into a location, and whose value corresponds to the number of locations with that placement. In high multiplicity problems items come in types, and are represented succinctly by a vector of multiplicities; solving the configuration IP then amounts to deciding whether the input vector of multiplicities of items of each type can be decomposed into a given number of configurations. We make this implicit notion explicit by observing that the set of all input vectors decomposable into configurations forms a monoid, and solving the configuration IP is the Monoid Decomposition problem. Motivated by applications, we enrich this problem in two ways. First, sometimes each configuration additionally has an objective value, yielding an optimization problem of finding a "best" decomposition under the given objective. Second, there are often different types of configurations for different types of locations. The resulting problem is to optimize over decompositions of the input multiplicity vector into configurations of several types, and we call it Multitype Integer Monoid Optimization, or MIMO. We develop fast exact algorithms for various MIMO with few or many location types and with various objectives. Our algorithms build on a novel proximity theorem connecting the solutions of a certain configuration IP to those of its continuous relaxation. We then cast several fundamental scheduling and bin packing problems as MIMOs, and thereby obtain new or substantially faster algorithms for them. We complement our positive algorithmic results by hardness results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑