An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphsReport as inadecuate




An efficient cutting plane algorithm for the minimum weighted elementary directed cycle problem in planar digraphs - Download this document for free, or read online. Document in PDF available to download.

1 FST-UAM - Faculté des Sciences et Techniques, Université Abdou-Moumouni, Niamey-Niger 2 Université Fédérale de Rio de Janeiro 3 DECISION LIP6 - Laboratoire d-Informatique de Paris 6

Abstract : In this paper, we study the efficiency both theoretically and computationally of a class of valid inequalities for the minimum weighted elementary directed cycle problem MWEDCP in planar digraphs with negative weight elementary directed cycles. These valid inequalities are called cycle valid inequalities and are parametrized by an integer called inequality-s order. From a theoretical point of view, we prove that separating cycle valid inequalities of order 1 in planar digraph can be done in polynomial time. From a computational point of view, we present a cutting plane algorithm featuring the efficiency of a lifted form of the cycle valid inequalities of order 1. In addition to these lifted valid inequalities, our algorithm is also based on a mixed integer linear formulation of the MWEDCP. The computational results are carried out on randomly generated planar digraph instances of the MWEDCP. For all 29 instances considered, we obtain in average 26.47% gap improvement. Moreover, for some of our instances the strengthening process directly displays the optimal integer elementary directed cycle.

Keywords : linear relaxation polytope valid inequality cycle digraph





Author: M. S. Ibrahim - Nelson Maculan - Hacène Ouzia -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents