A multiperiod degree constrained minimal spanning tree problem
From MaRDI portal
Publication:1848629
DOI10.1016/S0377-2217(01)00321-6zbMATH Open1073.90530MaRDI QIDQ1848629FDOQ1848629
Authors: Rakesh Kawatra
Publication date: 13 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
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
- Title not available (Why is that?)
- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Topological design of centralized computer networks—formulations and algorithms
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- Title not available (Why is that?)
- Validation of subgradient optimization
- A good algorithm for smallest spanning trees with a degree constraint
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Edge exchanges in the degree-constrained minimum spanning tree problem
- The Held—Karp algorithm and degree-constrained minimum 1-trees
- Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
Cited In (12)
- A multiperiod min-sum arborescence problem
- 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
- Spanning trees with variable degree bounds
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH
- A multiperiod planning model for the capacitated minimal spanning tree problem
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- A hop constrained min-sum arborescence with outage costs
- Edge exchanges in the degree-constrained minimum spanning tree problem
- Spanning trees with generalized degree constraints arising in the design of wireless networks
- The Minimum Spanning Tree Problem with Time Window Constraints
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)