Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut.

Francisco Barahona Laszlo Ladányi

Published in: RAIRO Oper. Res. (2006)

Keyphrases

max cut
minimum spanning tree
computational complexity
linear programming
search space
k means
steiner tree
objective function
planar graphs
graph partitioning
graph model
tree structure
knapsack problem
graph structure
np complete
simulated annealing
worst case
dynamic programming
np hard
bayesian networks