Graphs and algorithms
Combinatorial optimization
Reload cost problems: minimum diameter spanning tree
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Modeling and solving the rooted distance-constrained minimum spanning tree problem
Computers and Operations Research
Note: The complexity of a minimum reload cost diameter problem
Discrete Applied Mathematics
The Minimum Reload s-t Path/Trail/Walk Problems
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Note: The complexity of a minimum reload cost diameter problem
Discrete Applied Mathematics
On Minimum Reload Cost Cycle Cover
Discrete Applied Mathematics
Hi-index | 0.00 |
In this article, we consider the notion of “reload costs” in network design. Reload costs occur naturally in many different settings including telecommunication networks using diverse technologies. However, reload costs have not been studied extensively in the literature. Given that reload costs occur naturally in many settings, we are motivated by the desire to develop “good” models for network design problems involving reload costs. In this article, and as a first step in this direction, we propose and discuss the reload cost spanning tree problem (RCSTP). We show that the RCSTP is NP-complete. We discuss several ways of modeling network design problems with reload costs. These involve models that expand the original graph significantly—to a directed line graph and a colored graph—to model reload costs. We show that the different modeling approaches lead to models with the same linear programming bound. We then discuss several variations of reload cost spanning tree and network design problems, and discuss both their complexity and models for these variations. To assess the effectiveness of the proposed models to solve RCSTP instances, we present results taken from instances with up to 50 nodes, 300 edges, and nine technologies for several variations of the problem. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 © 2012 Wiley Periodicals, Inc.