Pages that link to "Item:Q1027523"
From MaRDI portal
The following pages link to Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523):
Displaying 17 items.
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- Transshipment service through crossdocks with both soft and hard time windows (Q763197) (← links)
- Discrete particle swarm optimization for the minimum labelling Steiner tree problem (Q968390) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- The minimum labeling spanning trees (Q1567492) (← links)
- Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
- Variable neighbourhood search for the \(k\)-labelled spanning forest problem (Q2631224) (← links)
- On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
- Solving the minimum labelling spanning tree problem using hybrid local search (Q2840755) (← links)
- Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)
- Finding minimum label spanning trees using cross‐entropy method (Q6065862) (← links)
