Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph

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 val...

Full description

Bibliographic Details
Main Author: Agra, Agostinho (author)
Other Authors: Doostmohammadi, Mahdi (author), Souza, Cid C. de (author)
Format: article
Language:eng
Published: 2018
Subjects:
Mixed integer programming
Valid inequality
Separation
Vertex packing set
Conflict graph
Independent set
Online Access:http://hdl.handle.net/10773/16477
Country:Portugal
Oai:oai:ria.ua.pt:10773/16477

Internet

http://hdl.handle.net/10773/16477

Similar Items