On LP relaxations for the pattern minimization problem.

Alessandro Aloisio Claudio Arbib Fabrizio Marinelli

Published in: Networks (2011)

Keyphrases

lp relaxation
linear programming
objective function
linear program
message passing
benders decomposition
computational complexity
pairwise
feasible solution