Intersecting a simple mixed integer set with a vertex packing set

Electronic Notes in Discrete Mathematics

Volumn 41, Issue , 2013, Pages 327-334

  Agra, Agostinho ^a   Doostmohammadi, Mahdi ^a   Carvalho de Souza, Cid ^b  

^a UNIVERSITY OF AVEIRO   (Portugal)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Conflict graph; Inventory routing; Mixed integer set; Valid inequalities

Indexed keywords

EID: 84879710671     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2013.05.109     Document Type: Article

References (10)

1. A. Agra, H. Andersson, M. Christiansen, L. Wolsey, A Maritime Inventory Routing Problem: Discrete Time Formulations and Valid Inequalities, submitted to journal.
2. Agra A., Christiansen M., Delgado A. Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem. Transportation Science 2013, 47:108-124.
3. Atamturk A., Nemhauser G.L., Savelsbegh M.W.P. Conflicts Graph in Integer Programming. European Journal of Operations Research 1998, 121:40-55.
4. Atamturk A., Nemhauser G.L., Savelsbegh M.W.P. The Mixed Vertex Packing Problem. Mathematical Programming 2000, 89:35-53.
5. Easton T., Hooker K., Lee E.K. Facets of the Independent Set Polytope. Mathematical Programming 2003, 98:177-199.
6. Fouilhoux P., Labbe M., Mahjoub A.R., Yaman H. Generating Facets for the Independence System Polytope. SIAM Journal on Discrete Mathematics 2009, 23:1484-1506.
7. Nemhauser G.L., Trotter L.E. Properties of Vertex Packing and Independence System Polyhedra. Mathematical Programming 1974, 6:48-61.
8. Padberg M.W. On the Facial Structure of Set Packing Polyhedra. Mathematical Programming 1973, 5:199-215.
9. Pochet Y., Wolsey L. Production Planning by Mixed Integer Programming 2005, Springer, New York.
10. Song J.-H., Furman K.C. A Maritime Inventory Routing Problem: Practical Approach. Computers and Operations Research 2013, 40:657-665.