Please use this identifier to cite or link to this item:
Title: Valid inequalities for the single arc design problem with set-ups
Author: Agra, Agostinho
Doostmohammadi, Mahdi
Louveaux, Quentin
Keywords: Mixed integer programming
Valid inequalities
Facet-defining inequalities
Issue Date: May-2015
Publisher: Elsevier
Abstract: We consider a mixed integer set which generalizes two well-known sets: the single node fixed-charge network set and the single arc design set. Such set arises as a relaxation of feasible sets of general mixed integer problems such as lot-sizing and network design problems. We derive several families of valid inequalities that, in particular, generalize the arc residual capacity inequalities and the flow cover inequalities. For the constant capacitated case we provide an extended compact formulation and give a partial description of the convex hull in the original space which is exact under a certain condition. By lifting some basic inequalities we provide some insight on the difficulty of obtaining such a full polyhedral description for the constant capacitated case. Preliminary computational results are presented.
Peer review: yes
DOI: 10.1016/j.disopt.2014.12.002
ISSN: 1572-5286
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
manuscript_DO_Agra_Doostmohammadi_Louveaux.pdfMain article424.94 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.