The Steiner Tree Problem with Delays: A compact formulation and reduction procedures

Valeria Leggieri*, Mohamed Haouari, Chefi Triki

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

16 اقتباسات (Scopus)

ملخص

This paper investigates the Steiner Tree Problem with Delays (STPD), a variation of the classical Steiner Tree problem that arises in multicast routing. We propose an exact solution approach that is based on a polynomial-size formulation for this challenging NP-hard problem. The LP relaxation of this formulation is enhanced through the derivation of new lifted Miller-Tucker-Zemlin subtour elimination constraints. Furthermore, we present several preprocessing techniques for both reducing the problem size and tightening the LP relaxation. Finally, we report the results of extensive computational experiments on instances with up to 1000 nodes. These results attest to the efficacy of the combination of the enhanced formulation and reduction techniques.

اللغة الأصليةEnglish
الصفحات (من إلى)178-190
عدد الصفحات13
دوريةDiscrete Applied Mathematics
مستوى الصوت164
رقم الإصدارPART 1
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2014
منشور خارجيًانعم

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2607???
  • ???subjectarea.asjc.2600.2604???

بصمة

أدرس بدقة موضوعات البحث “The Steiner Tree Problem with Delays: A compact formulation and reduction procedures'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا