Optimizing over the split closure

Mathematical Programming

Volumn 113, Issue 2, 2008, Pages 219-240

  Balas, Egon ^a   Saxena, Anureet ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; INTEGRATION; OPTIMIZATION; PROBLEM SOLVING; RELAXATION PROCESSES;

FIXED CHARGE NETWORK FLOW; FRACTIONAL POINTS; INTEGER INSTANCES; MIP SOLVERS;

COMPUTATIONAL GEOMETRY;

EID: 38749096673     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0049-5     Document Type: Article

References (26)

1. Ahuja R.K., Orlin J.B., Pallottino S., Scaparra M.P., Scutellà M.G. (2004) A multi-exchange heuristic for the single source capacitated facility location problem. Manage. Sci. 50(6): 749-760
2. Andersen K., Cornuéjols G., Li Y. (2005) Split closure and intersection cuts. Math. Program. A 102, 457-493
3. Atamtürk A. (2001) Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29, 107-114
4. Atamtürk A., Munóz J.C. (2004) A study of the lot-sizing polytope. Math. Prog. 99, 443-465
5. Atamtürk A., Rajan D. (2002) On splittable and unsplittable capacitated network design arc-set polyhedra. Math. Program. 92, 315-333
6. Balas E. (1979) Disjunctive programming. Ann. Discrete Math. 5, 3-51
7. Balas E., Ceria S., Cornuéjols G. (1993) A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-324
8. Balas E., Ceria S., Cornuéjols G. (1996) Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Manage. Sci. 42, 1229-1246
9. Balas E., de Souza C. (2005) The vertex separator problem: a polyhedral investigation. Math. Program. 103(3): 583-608
10. Balas E., Perregaard M. (2002) Lift and project for mixed 0-1 programming: recent progress. Discrete Appl. Math. 123, 129-154
11. Balas E., Perregaard M. (2003) A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming. Math. Program. B 94, 221-245
12. Balas, E., Saxena, A. Separation functions in disjunctive programming (in preparation)
13. Beasley, J.E. OR-Library, people.brunel.ac.uk/~mastjjb/jeb/info.html
14. Berkeley Computational Optimization Lab, http://ieor.berkeley.edu/ ~atamturk/data
15. Bonami B., Minoux M. (2005) Using rank 1 lift-and-project closures to generate cuts for 0-1 MIP's, a computational investigation. Discrete optim. 2, 288-308
16. Bonami, P., Cornuéjols, G., Dash, S., Fischetti, M., Lodi, A. Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. A (to appear)
17. Caprara A., Letchford A. (2003) On the separation of split cuts and related inequalities. Math. Program. 94, 279-294
18. COIN: Computational infrastructure for operations research, http://www.coin-or.org
19. Cook W.J., Kannan R., Schrijver A. (1990) Chvatal closures for mixed integer programming problems. Math. Program. 47, 155-174
20. Cornuéjols G., Li Y. (2001) Elementary closures for integer programs. Oper. Res. Lett. 28, 1-8
21. Dash, S., Günlük, O., Lodi, A. Optimizing over the MIR closure. Talk presented at INFORMS Meeting (San Francisco), November (2005)
22. de Souza C., Balas E. (2005) The vertex separator problem: algorithms and computations. Math. Program. 103(3): 609-631
23. Fischetti, M., Lodi, A. Optimizing over the first Chvátal closure. Math. Program. B (to appear)
24. Holmberg K., Ronnqvist M., Yuan D. (1999) An exact algorithm for the capacited facility location problems with single sourcing. Eur. J. Oper. Res. 113, 544-559
25. Nazareth J.L. (1991) The homotopy principle and algorithms for linear programming. SIAM J. Optim. 1, 316-332
26. Saxena, A. OSCLIB, http://www.andrew.cmu.edu/user/anureets/osc/osc.htm