A tutorial on branch and cut algorithms for the maximum stable set problem.

Steffen Rebennack Gerhard Reinelt Panos M. Pardalos

Published in: Int. Trans. Oper. Res. (2012)

Keyphrases

computationally efficient
orders of magnitude
data structure
computational complexity
recently developed
real world
learning algorithm
computational cost
times faster
knowledge discovery
state space
linear programming
theoretical analysis
computational efficiency