Login / Signup
Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem.
Andrea Grosso
Marco Locatelli
Federico Della Croce
Published in:
J. Heuristics (2004)
Keyphrases
</>
feature selection
greedy algorithm
search algorithm
dynamic programming
weighted sum
relative importance
hidden nodes
information retrieval
linear combination
adaptive learning
real time
search space
directed graph
branch and bound algorithm
hill climbing
weighted average