Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/16480
Title: Lifted euclidean inequalities for the integer single node flow set with upper bounds
Author: Agra, Agostinho
Constantino, Miguel Fragoso
Keywords: Valid inequalities
Mixed integer programming
Polyhedral description
Single node flow set
Issue Date: May-2016
Publisher: Elsevier
Abstract: In this paper we discuss the polyhedral structure of the integer single node flow set with two possible values for the upper bounds on the arc flows. Such mixed integer sets arise as substructures in complex mixed integer programs for real application problems. This work builds on results for the integer single node flow polytope with two arcs given by Agra and Constantino, 2006a. Valid inequalities are extended to a new family, the lifted Euclidean inequalities, and a complete description of the convex hull is given. All the coefficients of the facet-defining inequalities can be computed in polynomial time. We report on some computational experimentations for three problems: an inventory distribution problem, a facility location problem and a multi-item production planning model.
Peer review: yes
URI: http://hdl.handle.net/10773/16480
DOI: 10.1016/j.ejor.2015.10.057
ISSN: 0377-2217
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
isnfs_ria.pdfDocumento principal229.19 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

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