Pages that link to "Item:Q1025243"
From MaRDI portal
The following pages link to VNS and second order heuristics for the min-degree constrained minimum spanning tree problem (Q1025243):
Displaying 10 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← 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)
- DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH (Q2790350) (← 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)
