A greedy heuristic for the capacitated minimum spanning tree problem.

Manolis N. Kritikos George Ioannou

Published in: J. Oper. Res. Soc. (2017)

Keyphrases

greedy heuristic
greedy algorithm
np hard
neighborhood structure
knapsack problem
minimum weight
worst case analysis
optimal solution
set cover
lower bound
minimum spanning tree
objective function
minimum cost
similarity measure
decision trees
image processing
genetic algorithm