Pages that link to "Item:Q496663"
From MaRDI portal
The following pages link to The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663):
Displaying 21 items.
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Optimality cuts and a branch-and-cut algorithm for the \(k\)-rooted mini-max spanning forest problem (Q319778) (← links)
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
- Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522) (← links)
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243) (← links)
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← 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)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- A branch and cut method for the degree-constrained minimum spanning tree problem (Q2714906) (← links)
- Finding min-degree constrained spanning trees faster with a branch-and-cut algorithm (Q2883578) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- A branch and bound algorithm for the capacitated minimum spanning tree problem (Q3141109) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
