A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs.

Martin Bergner Marco E. Lübbecke Jonas T. Witt

Published in: SEA (2014)

Keyphrases

undirected graph
dynamic programming
np hard
probabilistic model
worst case
graph structure
objective function
optimal solution
computational complexity
pairwise
linear programming
expectation maximization
packing problem
vertex set