Pages that link to "Item:Q733522"

The following pages link to Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522):

Displaying 14 items.

• When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
• Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
• A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
• Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
• New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
• New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
• A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem (Q1728477) (← links)
• New genetic algorithm approach for the MIN-degree constrained minimum spanning tree (Q1751721) (← links)
• An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586) (← links)
• A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
• The generalized dependency constrained spanning tree problem (Q2132411) (← links)
• Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm (Q2883578) (← links)