Two-phase branch-and-cut for the mixed capacitated general routing problem
We deal with the Mixed Capacitated General Routing Problem (MCGRP). We propose an exact two-phase branch-and-cut algorithm to solve the problem. The algorithm is based on a new formulation using two-index variables. Extensive computational experiments prove the effectiveness of our approach.
general routing problem branch-and-cut algorithm mixed graph integer programming