混合整数线性最优化中的新对称性:对称逻辑和基于补的对称性
New symmetries in mixed-integer linear optimization: Symmetry heuristics and complement-based symmetries
摘要:
我们提出了混合整数线性规划的对称性的两个新的应用。首先,我们提出了一个新的启发式的两个变种,以提高使用对称性的可行解的目标值。这些算法可以使用实际的排列或变量的轨道来找到更好的可行解。然后,我们介绍了一类新的对称性二元MILP问题。除了通常的变量置换外,这些对称性还可以取二元变量的补。这在两个相反的决策实际上彼此对称的情况下很有用。我们讨论了这些对称性的理论,并提出了一种计算方法来计算它们。实例来说明这些技术的实用性。
英文摘要:
We present two novel applications of symmetries for mixed-integer linear programming. First we propose two variants of a new heuristic to improve the objective value of a feasible solution using symmetries. These heuristics can use either the actual permutations or the orbits of the variables to find better feasible solutions. Then we introduce a new class of symmetries for binary MILP problems. Besides the usual permutation of variables, these symmetries can also take the complement of the binary variables. This is useful in situations when two opposite decisions are actually symmetric to each other. We discuss the theory of these symmetries and present a computational method to compute them. Examples are presented to illustrate the usefulness of these techniques.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。