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

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

Published in: ACM J. Exp. Algorithmics (2016)

Keyphrases

search space
worst case
graph structure
undirected graph
computational complexity
dynamic programming
probabilistic model
expectation maximization
np hard
parameter estimation
multicommodity flow