arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2605.02582math.OC
收藏

整数线性规划的线性决策树策略

Linear Decision Tree Policies for Integer Linear Programs

Polytechnique Montréal(蒙特利尔理工学院);Pontifical Catholic University of Rio de Janeiro(里约热内卢天主教大学);Technical University of Munich(慕尼黑工业大学);Fluminense Federal University(弗鲁米嫩塞联邦大学)

Théo Guyard, Cleber Oliveira, Maximilian Schiffer, Eduardo Uchoa, Thibaut Vidal

AI总结:

研究整数线性规划中以线性决策树表示的最优决策策略,证明最坏情况多项式运算策略存在,确定特定叶数策略判定为\(\Sigma_2^p\)-完全,开发实用框架,实验表明其检索最优解比传统方法快,提供新求解视角与离线-在线方法。

摘要:

我们研究了用于具有固定可行集和变化成本向量的整数线性规划的最优决策策略,其以线性决策树表示。一旦针对给定可行集合成,它们通过一系列线性测试为任何查询的成本向量返回最优解。我们表明,在最坏情况下存在一种策略能在多项式数量的算术运算中执行此操作。相比之下,确定是否存在具有规定最大叶数的精确策略是\(\Sigma_2^p\)-完全的。除了这些理论结果,我们还开发了一个实用的构建框架来在特定子类的线性决策树中合成策略。我们的计算实验表明,虽然策略合成可能耗时,但在重复查询时,它能比经典和专门的求解方法快几个数量级地检索到最优解。总体而言,这种范式为整数线性规划的求解提供了不同视角,并为重复优化提供了一种有原则的离线-在线方法。

英文摘要:

We study optimal decision policies, represented as linear decision trees, for integer linear programs with a fixed feasible set and varying cost vectors. Once synthesized for a given feasible set, they return an optimal solution for any queried cost vector through a sequence of linear tests. We show that there exists a policy performing this operation in a polynomial number of arithmetic operations in the worst case. In contrast, deciding whether there exists an exact policy with a prescribed maximum number of leaves is $Σ_2^p$-complete. Alongside these theoretical results, we develop a practical construction framework to synthesize policies within a specific subclass of linear decision trees. Our computational experiments show that, although policy synthesis can be time-intensive, it allows one to retrieve optimal solutions orders of magnitude faster than classical and specialized solution methods on repeated queries. Overall, this paradigm provides a different perspective on the solution of integer linear programs and offers a principled offline-online approach for repeated optimization.

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

↑