TY - JOUR
T1 - Intersecting a Simple Mixed Integer Set with a Vertex Packing Set
AU - Agra, Agostinho
AU - Doostmohammadi, Mahdi
AU - De Souza, Cid C.
PY - 2013/6
Y1 - 2013/6
N2 - We consider a mixed integer set that results from the intersection of a simple mixed integer set with a vertex packing set from a conflict graph. This set arises as a relaxation of the feasible set of mixed integer problems such as inventory routing problems. We derive families of strong valid inequalities that consider the structures of the simple mixed integer set and the vertex packing set simultaneously.
AB - We consider a mixed integer set that results from the intersection of a simple mixed integer set with a vertex packing set from a conflict graph. This set arises as a relaxation of the feasible set of mixed integer problems such as inventory routing problems. We derive families of strong valid inequalities that consider the structures of the simple mixed integer set and the vertex packing set simultaneously.
U2 - 10.1016/j.endm.2013.05.109
DO - 10.1016/j.endm.2013.05.109
M3 - Article
SN - 1571-0653
VL - 41
SP - 327
EP - 334
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
ER -