A Branch-and-Cut Algorithm

In this chapter, we describe the details of the implementation of a Branch-and-Cut algorithm for the 2CNBR problem. In Section 6.1, we address the problem of determining if a network is feasible. In Sections 6.2 to 6.8, we study the Separation problems for all the valid inequalities described in the previous chapters. The order in which inequalities are presented here is not the same as in the previous chapters, because we wanted to group inequalities having similar Separation procedures. Section 6.9 outlines the Branch-and-Cut procedure and explains some strategy and Parameters choices. The last section of this chapter presents a summary of the polyhedral results obtained in this work.