A Relax-and-Cut framework for large-scale maximum weight connected subgraph problems.

Eduardo Álvarez-Miranda Markus Sinnl

Published in: Comput. Oper. Res. (2017)

Keyphrases

maximum weight
probabilistic model
learning algorithm
image segmentation
data structure
response time
bipartite graph