An Exact Algorithm for Solving the Ring Star Problem

Safia Kedad-Sidhoum 1 Viet Hung Nguyen 2
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
2 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This article deals with the ring star problem. It consists of finding a ring that goes through a central node and assigning every node not in the ring to a node in the ring so that the total design and assignment cost is minimized. We propose a new formulation based on the so-called st-chains which represent simple paths between two specific nodes s and t. We introduce new facet-defining inequalities and we develop an efficient branch-and-cut algorithm for the problem. Computational results that show the efficiency of our approach are presented.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01170329
Contributor : Lip6 Publications <>
Submitted on : Wednesday, July 1, 2015 - 1:50:45 PM
Last modification on : Thursday, March 21, 2019 - 2:52:20 PM

Identifiers

Citation

Safia Kedad-Sidhoum, Viet Hung Nguyen. An Exact Algorithm for Solving the Ring Star Problem. Optimization, Taylor & Francis, 2010, 59 (1), pp.125-140. ⟨10.1080/02331930903500332⟩. ⟨hal-01170329⟩

Share

Metrics

Record views

137