The separation problem of rounded capacity inequalities: Some polynomial cases

作     者：Diarrassouba, Ibrahima 

作者机构：Normandie Univ UNIHAVRE LMAH FR CNRS 5335 F-76600 Le Havre France 

出 版 物：《DISCRETE OPTIMIZATION》 (离散优化)

年 卷 期：2017年第23卷

页      面：33-55页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070102[理学-计算数学] 0701[理学-数学] 

主　　题：Polynomial separation algorithm Rounded capacity inequalities Capacitated vehicle routing problem Submodular function 

摘      要：In this paper we are interested in the separation problem of the so-called rounded capacity inequalities which are involved in the two-index formulation of the CVRP (Capacitated Vehicle Routing Problem) polytope. In a recent work (Diarrassouba, 2015, [1]), we have investigated the theoretical complexity of that problem in the general case. Several authors have devised heuristic separation algorithms for rounded capacity inequalities for solving the CVRP. In this paper, we investigate the conditions under which this separation problem can be solved in polynomial time, and this, in the context of the CVRP or for solving other combinatorial optimization problems in which rounded capacity inequalities are involved. We present four cases in which they can be separated in polynomial time and reduce the problem to O(n(2)) maximum flow computations. (C) 2016 Elsevier B.V. All rights reserved.