A branch-and-cut algorithm for the capacitated open vehicle routing problem
提出了首个精确求解开放式带容量约束车辆路径问题的分支切割算法，通过改进整数规划模型和割平面，首次评估了现有启发式方法的质量，并比较了开放与封闭版本问题的难度差异。
In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch-and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem.