Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/328025
Type: Artigo
Title: Valid Inequalities For A Single Constrained 0-1 Mip Set Intersected With A Conflict Graph
Author: Agra
Agostinho; Doostmohammadi
Mandi; de Souza
Cid C.
Abstract: In this paper a mixed integer set resulting from the intersection of a single constrained mixed 0-1 set with the vertex packing set is investigated. This set arises as a subproblem of more general mixed integer problems such as inventory routing and facility location problems. Families of strong valid inequalities that take into account the structure of the simple mixed integer set and that of the vertex packing set simultaneously are introduced. In particular, the well-known mixed integer rounding inequality is generalized to the case where incompatibilities between binary variables are present. Exact and heuristic algorithms are designed to solve the separation problems associated to the proposed valid inequalities. Preliminary computational experiments show that these inequalities can be useful to reduce the integrality gaps and to solve integer programming problems. (C) 2016 Elsevier B.V. All rights reserved.
Subject: Mixed Integer Programming
Valid Inequality
Separation
Vertex Packing Set
Conflict Graph
Independent Set
Editor: Elsevier Science BV
Amsterdam
Citation: Discrete Optimization. Elsevier Science Bv, v. 21, p. 42 - 70, 2016.
Rights: fechado
Identifier DOI: 10.1016/j.disopt.2016.05.005
Address: http://www.sciencedirect.com/science/article/pii/S1572528616300378
Date Issue: 2016
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000381955200004.pdf863.03 kBAdobe PDFView/Open


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