Intersecting a simple mixed integer set with a vertex packing set

Agostinho Agra, Mahdi Doostmohammadi, Cid Carvalho de Souza

Research output: Contribution to journalConference Contributionpeer-review

1 Citation (Scopus)

Abstract

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
Number of pages8
JournalElectronic Notes in Discrete Mathematics
Volume41
DOIs
Publication statusPublished - 5 Jun 2013
Externally publishedYes

Keywords

  • mixed integer set
  • conflict graph
  • valid inequalities
  • inventory routing

Fingerprint

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