Pages that link to "Item:Q1121788"
From MaRDI portal
The following pages link to A Lagrangean approach to the degree-constrained minimum spanning tree problem (Q1121788):
Displayed 9 items.
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← 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)
- Minimal spanning trees with a constraint on the number of leaves (Q1291653) (← 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)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)