Pages that link to "Item:Q1755227"
From MaRDI portal
The following pages link to A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227):
Displaying 8 items.
- Efficient heuristics for the minimum labeling global cut problem (Q1791898) (← links)
- Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem (Q1886801) (← links)
- An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
- A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
- The rainbow Steiner tree problem (Q2669791) (← links)
- Solving the minimum labelling spanning tree problem using hybrid local search (Q2840755) (← links)
- A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems (Q3652111) (← links)
- Finding minimum label spanning trees using cross‐entropy method (Q6065862) (← links)