We address the Max Cut problem by developing a compact formulation from the model expressing the condition that cuts and circuits have even intersection. This formulation turns out to be effective on sparse graphs especially with respect to the model based on triples of nodes.
An effective compact formulation of the max cut problem on sparse graphs
LANCIA, Giuseppe;SERAFINI, Paolo
2011-01-01
Abstract
We address the Max Cut problem by developing a compact formulation from the model expressing the condition that cuts and circuits have even intersection. This formulation turns out to be effective on sparse graphs especially with respect to the model based on triples of nodes.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
