A multiperiod degree constrained minimal spanning tree problem

DOI10.1016/S0377-2217(01)00321-6zbMath1073.90530MaRDI QIDQ1848629

Rakesh Kawatra

Publication date: 13 November 2002

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

zbMATH Keywords

Integer programmingHeuristicsCommunication networks

Mathematics Subject Classification ID

Integer programming (90C10) Communication networks in operations research (90B18)

Related Items (3)

A hop constrained min-sum arborescence with outage costs ⋮ Exact solution approaches for the multi-period degree constrained minimum spanning tree problem ⋮ A multiperiod min-sum arborescence problem

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Validation of subgradient optimization

This page was built for publication: A multiperiod degree constrained minimal spanning tree problem