Reload cost trees and network design

DOI10.1002/net.20443zbMath1248.68379MaRDI QIDQ2913949

Ioannis Gamvros, Luís Gouveia, S. Raghu Raghavan

Publication date: 21 September 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20443

zbMATH Keywords

network design; spanning trees; integer programming formulations; reload costs; diameter/hop constraints; Steiner variants

Mathematics Subject Classification ID

90C10: Integer programming

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

Related Items

Unnamed Item, Quadratic Combinatorial Optimization Using Separable Underestimators, Constructing minimum changeover cost arborescenses in bounded treewidth graphs, Minimum reload cost graph factors, Parameterized complexity of finding a spanning tree with minimum reload cost diameter, On minimum reload cost cycle cover, The minimum reload \(s-t\) path, trail and walk problems, The complexity of a minimum reload cost diameter problem, The quadratic cycle cover problem: special cases and efficient bounds, On the complexity of constructing minimum changeover cost arborescences, On Minimum Reload Cost Cycle Cover, Reload cost trees and network design, On minimum reload cost paths, tours, and flows, The Minimum Reload s-t Path/Trail/Walk Problems

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of a minimum reload cost diameter problem
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• Reload cost trees and network design
• On minimum reload cost paths, tours, and flows
• Optimum Communication Spanning Trees
• The Minimum Reload s-t Path/Trail/Walk Problems
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• A catalog of steiner tree formulations
• Reload cost problems: Minimum diameter spanning tree