Pages that link to "Item:Q623311"

The following pages link to Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311):

Displaying 8 items.

• Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
• The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (Q2018861) (← links)
• The minimum cost hop-and-root constrained forest in wireless sensor networks (Q2840531) (← links)
• Stabilizing branch‐and‐price for constrained tree problems (Q5326785) (← links)
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
• Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem (Q5955562) (← links)
• On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)