Complexity of a classical flow restoration problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networks Année : 2013

Complexity of a classical flow restoration problem

Résumé

In this article, we revisit a classical optimization problem occurring in designing survivable multicommodity flow networks. The problem, referred to as FR, assumes flow restoration that takes advantage of the so-called stub release. As no compact linear programming (LP) formulation of FR is known and at the same time all known noncompact LP formulations of FR exhibit eNP-hard dual separation, the problem itself is believed to be NP-hard, although without a proof. In this article, we study a restriction of FR (RFR) that assumes only elementary (cycle-free) admissible paths--an important case virtually not considered in the literature. The two problems have the same noncompact LP formulations as they differ only in the definition of admissible paths: all paths (also those including cycles) are allowed in FR, while only elementary paths are allowed in RFR. Because of that, RFR is in general computationally more complex than FR. The purpose of this article, is three-fold. First, the article reveals an interesting special case of RFR--the case with only one failing link--for which a natural noncompact LP formulation obtained by reducing the general RFR formulation still exhibits NP-hard dual separation, but nevertheless this special case of RFR is polynomial. The constructed example of a polynomial multicommodity flow problem with difficult dual separation is of interest since, to our knowledge, no example of this kind has been known. In this article, we also examine a second special case of RFR, this time assuming two failing links instead of one, which turns out to be NP-hard. This implies that problem RFR is NP-hard in general (more precisely, for two or more failure states). This new result is the second contribution of the article. Finally, we discuss the complexity of FR in the light of our new findings, emphasizing the differences between RFR and FR.

Dates et versions

hal-00917404 , version 1 (11-12-2013)

Identifiants

Citer

Dritan Nace, Michal Pioro, Artur Tomaszewski, Mateusz Zotkiewicz. Complexity of a classical flow restoration problem. Networks, 2013, 62 (2), pp.149-160. ⟨10.1002/net.21508⟩. ⟨hal-00917404⟩
85 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More