Design of capacitated degree constrained min-sum arborescence

Rakesh Kawatra ()
Additional contact information
Rakesh Kawatra: Minnesota State University

OPSEARCH, 2022, vol. 59, issue 3, No 12, 1038-1054

Abstract: Abstract The capacitated degree constrained min-sum arborescence problem consists of finding a directed spanning tree in a network to connect a set of terminal nodes to a central node with minimal total cost where the links in the network are directed away from the central node. The number links incident on each terminal node is limited by the number of ports available on them (degree constraint). Additionally, the reliability and response time constraints limit the number of nodes in the sub-trees rooted at the central node (capacity constraint). This problem is formulated as an integer-programming problem and a branch exchange heuristic embedded in the Lagrangian relaxation method is used to find a good feasible solution. The lower bound found as a byproduct of this solution method is used to estimate the quality of the solution given by our heuristic. Experimental results over a wide range of problem structures show that our heuristic method gives good solutions to this problem.

Keywords: Integer programming; Networks; Heuristics; Lagrangian relaxation (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-022-00575-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:59:y:2022:i:3:d:10.1007_s12597-022-00575-3

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-022-00575-3

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().