An Exact Algorithm for Solving the Ring Star Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization Année : 2010

An Exact Algorithm for Solving the Ring Star Problem

Safia Kedad-Sidhoum
Viet Hung Nguyen

Résumé

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.
Fichier non déposé

Dates et versions

hal-01170329 , version 1 (01-07-2015)

Identifiants

Citer

Safia Kedad-Sidhoum, Viet Hung Nguyen. An Exact Algorithm for Solving the Ring Star Problem. Optimization, 2010, 59 (1), pp.125-140. ⟨10.1080/02331930903500332⟩. ⟨hal-01170329⟩
188 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More