Pages that link to "Item:Q421519"
From MaRDI portal
The following pages link to New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519):
Displaying 11 items.
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978) (← links)
- The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (Q2018861) (← links)
- An exact approach for the minimum-cost bounded-error calibration tree problem (Q2178300) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
- Two dependency constrained spanning tree problems (Q6067892) (← links)
- Minimum weight clustered dominating tree problem (Q6109249) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
