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

变量剔除问题最优解的算法

An algorithm for the optimal solution of variable knockout problems

J. E. Beasley

AI总结:

本文研究0-1整数规划中的变量剔除问题,旨在选择合适的变量设为零,使剩余问题的最优解具备期望属性或不可行,并提出一种求解该问题的最优算法,通过最短路径阻断示例验证了有效性。

摘要:

我们考虑一类与变量剔除相关的问题,其中剔除指将变量设为零。给定一个表述为0-1整数规划的优化问题,本文研究的问题是为该问题选择一组合适的剔除变量,使得剔除后剩余问题的最优解具有期望属性。该属性可能与剔除后的最优解值有关,或要求剔除后的问题不可行。我们提出了一种算法来求解该剔除问题的最优解。基于使用公开可用的最短路径测试问题的最短路径阻断示例,给出了计算结果。

英文摘要:

We consider a class of problems related to variable knockout, where knockout means set a variable to zero. Given an optimisation problem formulated as a zero-one integer program the question we consider in this paper is what might be an appropriate set of variables to knockout of the problem, in order that the optimal solution to the problem that remains after variable knockout has a desired property. This property might be related to the optimal solution value after knockout, or require the problem after knockout to be infeasible. We present an algorithm for the optimal solution of this knockout problem. Computational results are given for an illustrative example based upon shortest path interdiction using publicly available shortest path test problems.

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

↑