Login / Signup
A new upper bound for the maximum weight clique problem.
Chu-Min Li
Yanli Liu
Hua Jiang
Felip Manyà
Yu Li
Published in:
Eur. J. Oper. Res. (2018)
Keyphrases
</>
maximum weight
upper bound
lower bound
bipartite graph
bipartite matching
minimum weight
np hard
partial order
independent set
worst case
weighted graph
bipartite graph matching
branch and bound algorithm
objective function
active learning