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

Discrete Optimization

Volumn 21, Issue , 2016, Pages 42-70

  Agra, Agostinho ^a   Doostmohammadi, Mahdi ^b   De Souza, Cid C ^c  

^a UNIVERSITY OF AVEIRO   (Portugal)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Conflict graph; Independent set; Mixed integer programming; Separation; Valid inequality; Vertex packing set

Indexed keywords

HEURISTIC ALGORITHMS; PROBLEM SOLVING; SEPARATION;

CONFLICT GRAPH; INDEPENDENT SET; MIXED INTEGER PROGRAMMING; VALID INEQUALITY; VERTEX PACKINGS;

INTEGER PROGRAMMING;

EID: 84975721625     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2016.05.005     Document Type: Article

References (20)

1. H. Marchand, and L. Wolsey Aggregation and mixed integer rounding to solve MIPs Oper. Res. 49 2001 363 371
2. Y. Pochet, and L. Wolsey Production Planning by Mixed Integer Programming 2006 Springer New York
3. A. Atamtürk, G.L. Nemhauser, and M.W.P. Savelsbegh Conflict graphs in integer programming European J. Oper. Res. 121 1998 40 55
4. T. Achterberg Conflict analysis in mixed integer programming Discrete Optim. 4 2007 4 20
5. T. Easton, K. Hooker, and E.K. Lee Facets of the independent set polytope Math. Program. 98 2003 177 199
6. P. Fouilhoux, M. Labbe, A.R. Mahjoub, and H. Yaman Generating facets for the independence system polytope SIAM J. Discrete Math. 23 2009 1484 1506
7. G.L. Nemhauser, and L.E. Trotter Properties of vertex packing and independence system polyhedra Math. Program. 6 1974 48 61
8. M.W. Padberg On the facial structure of set packing polyhedra Math. Program. 5 1973 199 215
9. A. Agra, M. Doostmohammadi, and Cid C. de Souza Intersecting a simple mixed integer set with a vertex packing set Electron. Notes Discrete Math. 41 2013 327 334
10. A. Atamtürk, G.L. Nemhauser, and M.W.P. Savelsbegh The mixed vertex packing problem Math. Program. 89 2000 35 53
11. A. Atamtürk, and M. Zhang The flow set with partial order Math. Oper. Res. 33 2008 730 746
12. A. Agra, H. Andersson, M. Christiansen, and L. Wolsey A maritime inventory routing problem: Discrete time formulations and valid inequalities Networks 62 2013 297 314
13. A. Agra, M. Christiansen, A. Delgado, and L. Simonetti Hybrid heuristics for a short sea inventory routing problem European J. Oper. Res. 236 2014 924 935
14. M. Laurent A generalization of antiwebs to independence systems and their canonical facets Math. Program. 45 1989 97 108
15. T. Christof, A. Löbel, PORTA-POlyhedron Representation Transformation Algorithm. http://comopt.ifi.uni-heidelberg.de/software/PORTA/.
16. L. Gouveia, and P. Pires Solving the maximum edge-weight clique problem in sparse graphs with compact formulations Eur. J. Comput. Optim. 3 2015 1 30
17. K. Park, K. Lee, and S. Park An extended formulation approach to the edge-weighted maximal clique problem European J. Oper. Res. 95 1996 671 682
18. B. Gendron, A. Hertz, and P. St-Louis A sequential elimination algorithm for computing bounds on the clique number of a graph Discrete Optim. 5 2008 615 628
19. Xpress-Optimizer. http://www.fico.com/en/Products/DMTools/Pages/FICO-Xpress-Optimization-Suite.aspx.
20. G.L. Nemhauser, and G. Sigismondi A strong cutting plane/branch-and-bound algorithm for node packing J. Oper. Res. Soc. 43 1992 443 457