Abstract
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(n2) maximum flow computations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
