A multiperiod degree constrained minimal spanning tree problem

DOI10.1016/S0377-2217(01)00321-6MaRDI QIDQ1848629zbMATH OpenFDO

Authors Rakesh Kawatra

Publication date 13 November 2002

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

zbMATH Keywords

HeuristicsInteger programmingCommunication networks

Mathematics Subject Classification ID

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

Recommendations

• A multiperiod planning model for the capacitated minimal spanning tree problem
• Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
• Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
• A multiperiod min-sum arborescence problem
• Minimal spanning trees with a constraint on the number of leaves

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1054929 (Why is no real title available?)
• A Lagrangean approach to the degree-constrained minimum spanning tree problem
• A good algorithm for smallest spanning trees with a degree constraint
• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
• Edge exchanges in the degree-constrained minimum spanning tree problem
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
• The Held—Karp algorithm and degree-constrained minimum 1-trees
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Topological design of centralized computer networks—formulations and algorithms
• Validation of subgradient optimization

Cited in

(12)

• A hop constrained min-sum arborescence with outage costs
• Edge exchanges in the degree-constrained minimum spanning tree problem
• A multiperiod planning model for the capacitated minimal spanning tree problem
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• Spanning trees with generalized degree constraints arising in the design of wireless networks
• Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
• Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• A multiperiod min-sum arborescence problem
• The Minimum Spanning Tree Problem with Time Window Constraints
• DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
• Spanning trees with variable degree bounds

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

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