The following pages link to (Q4325280):
Displaying 14 items.
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Greedy heuristics for the diameter-constrained minimum spanning tree problem (Q844529) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Solving diameter-constrained minimum spanning tree problems by constraint programming (Q3002550) (← links)
- Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem (Q3503535) (← links)
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (Q4918246) (← links)
- An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
