Optimizing over the split closure
暂无分享,去创建一个
[1] Matteo Fischetti,et al. Optimizing over the first Chvátal closure , 2005, Math. Program..
[2] Alberto Caprara,et al. On the separation of split cuts and related inequalities , 2003, Math. Program..
[3] Alper Atamtürk,et al. A study of the lot-sizing polytope , 2004, Math. Program..
[4] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .
[5] Alper Atamtürk,et al. Flow pack facets of the single node fixed-charge flow polytope , 2001, Oper. Res. Lett..
[6] Matteo Fischetti,et al. Projected Chvátal–Gomory cuts for mixed integer linear programs , 2008, Math. Program..
[7] Alper Atamtürk,et al. On capacitated network design cut–set polyhedra , 2002, Math. Program..
[8] Egon Balas,et al. Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..
[9] Di Yuan,et al. An exact algorithm for the capacitated facility location problems with single sourcing , 1999, Eur. J. Oper. Res..
[10] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[11] Maria Paola Scaparra,et al. Sloan School of Management Working Paper 4387-02 October 2002 A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM , 2002 .
[12] Egon Balas,et al. A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming , 2003, Math. Program..
[13] J. L. NAZARETH. The Homotopy Principle and Algorithms for Linear Programming , 1991, SIAM J. Optim..
[14] Egon Balas. Disjunctive Programming , 2010, 50 Years of Integer Programming.
[15] Egon Balas,et al. The vertex separator problem: a polyhedral investigation , 2005, Math. Program..
[16] Gérard Cornuéjols,et al. Elementary closures for integer programs , 2001, Oper. Res. Lett..
[17] William J. Cook,et al. Chvátal closures for mixed integer programming problems , 1990, Math. Program..
[18] Kent Andersen,et al. Split closure and intersection cuts , 2002, Math. Program..
[19] M. Minoux,et al. Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation , 2005, Discret. Optim..
[20] Alper Atamtürk,et al. On splittable and unsplittable flow capacitated network design arc–set polyhedra , 2002, Math. Program..
[21] Egon Balas,et al. The vertex separator problem: algorithms and computations , 2005, Math. Program..