Sign in
Improving upper bounds for the clique number by non-valid inequalities.
Marco Locatelli
Published in:
Math. Program. (2015)
Keyphrases
</>
upper bound
lower and upper bounds
valid inequalities
lower bound
computational complexity
special case
traveling salesman problem
search space
dynamic programming
worst case
dynamic systems