Intersecting a Simple Mixed Integer Set with a Vertex Packing Set

Agostinho Agra, Mahdi Doostmohammadi, Cid C. De Souza

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
Pages (from-to)327-334
JournalElectronic Notes in Discrete Mathematics
Publication statusPublished - Jun 2013


Dive into the research topics of 'Intersecting a Simple Mixed Integer Set with a Vertex Packing Set'. Together they form a unique fingerprint.

Cite this