The following pages link to (Q4350039):
Displaying 12 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem (Q724056) (← links)
- A hop constrained min-sum arborescence with outage costs (Q875410) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. (Q1426688) (← links)
- A multiperiod degree constrained minimal spanning tree problem (Q1848629) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Design of capacitated degree constrained min-sum arborescence (Q2085507) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- Lower and upper bounds for the degree-constrained minimum spanning tree problem (Q3593370) (← links)
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem (Q5236925) (← links)
