Reload cost trees and network design

DOI10.1002/NET.20443MaRDI QIDQ2913949zbMATH OpenOpenAlexFDO

Authors Ioannis Gamvros, Luis Gouveia, S. 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

diameter/hop constraintsinteger programming formulationsnetwork designreload costsspanning treesSteiner variants

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10)

Recommendations

• On minimum reload cost paths, tours, and flows
• Reload cost problems: Minimum diameter spanning tree
• On minimum reload cost cycle cover
• scientific article; zbMATH DE number 1420900
• On the complexity of constructing minimum changeover cost arborescences

Cites work

• A catalog of steiner tree formulations
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
• scientific article; zbMATH DE number 35513 (Why is no real title available?)
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• On minimum reload cost paths, tours, and flows
• Optimum Communication Spanning Trees
• Quantum computer feasibility and quantum mechanics interpretation
• Reload cost problems: Minimum diameter spanning tree
• Reload cost trees and network design
• The complexity of a minimum reload cost diameter problem
• The Minimum Reload s-t Path/Trail/Walk Problems

Cited in

(15)

• 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
• scientific article; zbMATH DE number 1420900 (Why is no real title available?)
• On minimum reload cost cycle cover
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter
• Quadratic Combinatorial Optimization Using Separable Underestimators
• Constructing minimum changeover cost arborescenses in bounded treewidth graphs
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter
• On penalized reload cost path, walk, tour and maximum flow: hardness and approximation
• The minimum reload \(s-t\) path, trail and walk problems

This page was built for publication: Reload cost trees and network design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913949)