Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.

DOI10.1016/S0377-2217(03)00071-7zbMath1043.90082OpenAlexW2026096794MaRDI QIDQ1426688

Rakesh Kawatra, Dennis L. Bricker

Publication date: 15 March 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00071-7

zbMATH Keywords

Integer programmingHeuristicsTelecommunications

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Precedence-constrained arborescences ⋮ DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH

Cites Work

• Edge exchanges in the degree-constrained minimum spanning tree problem
• A Lagrangean approach to the degree-constrained minimum spanning tree problem
• Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
• A multiperiod planning model for the capacitated minimal spanning tree problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Topological design of centralized computer networks—formulations and algorithms
• A good algorithm for smallest spanning trees with a degree constraint
• The Held—Karp algorithm and degree-constrained minimum 1-trees
• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
• Validation of subgradient optimization
• Unnamed Item
• Unnamed Item

This page was built for publication: Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.