Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization
Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization
复制标题
线性优化的邻域持续性整数线性优化的松弛
DOI:
10.1007/978-3-031-18530-4_23
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Kotaro Nakayama
中科院分区:
文献类型:
--
作者:
Kei Kimura;Kotaro Nakayama
For an integer linear optimization (ILO) problem, persistency of its linear optimization (LO) relaxation is a property that for every optimal solution of the relaxation that assigns integer values to some variables, there exists an optimal solution of the ILO problem in which these variables retain the same values. Although persistency has been used to develop heuristic, approximation, and fixed-parameter algorithms for special cases of ILO, its applicability remains unknown in the literature. In this paper, we propose a stronger property calledneighborhood persistencyand show that the LO relaxation of ILO on unit-two-variable-per-inequality (UTVPI) systems is a maximal class of ILO such that its LO relaxation has (neighborhood) persistency. Our result on neighborhood persistency generalizes the previous results of Nemhauser and Trotter, Hochbaum et al., and Fiorini et al., and implies fixed-parameter tractability and two-approximability for ILO on UTVPI systems where the objective function and the variables are non-negative.