Pages that link to "Item:Q709141"

The following pages link to New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141):

Displaying 11 items.

• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
• The capacitated minimal spanning tree problem: An experiment with a hop-indexed model (Q1290151) (← 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)
• Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
• Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
• A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem (Q4944737) (← links)
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
• On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)