文献类型：期刊文献

英文题名：New LP relaxations for minimum cycle/path/tree cover problems

作者：Yu, Wei[1]; Liu, Zhaohui[1]; Bao, Xiaoguang[2]

机构：[1] Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China; [2] College of Information Technology, Shanghai Ocean University, Shanghai, 201306, China

年份：2018

卷号：11343 LNCS

起止页码：221

外文期刊名：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

收录：EI(收录号：20185106263538)

语种：英文

外文关键词：Routing algorithms - Forestry - Undirected graphs - Vehicle routing

摘要：Given an undirected complete weighted graph G=(V,E) with nonnegative weight function obeying the triangle inequality, a set {C1,C2,…,Ck} of cycles is called a cycle cover if (Formula presented) and its cost is given by the maximum weight of the cycles. The Minimum Cycle Cover Problem (MCCP) aims to find a cycle cover of cost at most λ with the minimum number of cycles. We propose new LP relaxations for MCCP as well as its variants, called the Minimum Path Cover Problem (MPCP) and the Minimum Tree Cover Problem, where the cycles are replaced by paths or trees. Moreover, we give new LP relaxations for a special case of the rooted version of MCCP/MPCP and show that these LP relaxations have significantly better integrality gaps than the previous relaxations. ? Springer Nature Switzerland AG 2018.