Lift-and-project for Mixed 0-1 programming: recent progress
暂无分享,去创建一个
[1] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[2] William J. Cook,et al. Computational experience with parallel mixed integerprogramming in a distributed environment , 1999, Ann. Oper. Res..
[3] H. Kunzi,et al. Lectu re Notes in Economics and Mathematical Systems , 1975 .
[4] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[5] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[6] Nicholas Beaumont,et al. An algorithm for disjunctive programs , 1990 .
[7] Charles E. Blair. Facial disjunctive programs and sequence of cutting-planes , 1980, Discret. Appl. Math..
[8] H. P. Williams. An alternative explanation of disjunctive formulations , 1994 .
[9] Stefan Thienel,et al. ABACUS - a branch-and-CUt system , 1995 .
[10] Egon Balas,et al. Polyhedral methods for the maximum clique problem , 1994, Cliques, Coloring, and Satisfiability.
[11] Charles Eugene Blair. Two Rules for Deducing Valid Inequalities for 0-1 Problems , 1976 .
[12] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[13] E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .
[14] L. Lovász,et al. Annals of Discrete Mathematics , 1986 .
[15] Ignacio E. Grossmann,et al. Disjunctive Programming Techniques for the Optimization of Process Systems with Discontinuous Investment Costs−Multiple Size Regions , 1996 .
[16] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .
[17] E. Balas,et al. Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .
[18] E. Balas,et al. Strengthening cuts for mixed integer programs , 1980 .
[19] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[20] Hanif D. Sherali,et al. A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..
[21] Egon Balas,et al. Sequential convexification in reverse convex and disjunctive programming , 1989, Math. Program..
[22] Robert G. Jeroslow,et al. Representability in mixed integer programmiing, I: Characterization results , 1987, Discret. Appl. Math..
[23] Egon Balas. A modified lift-and-project procedure , 1997, Math. Program..
[24] H. P. Williams,et al. Logic-Based Decision Support: Mixed Integer Model Formulation , 1989 .
[25] Gábor Pataki,et al. Solving Integer and Disjunctive Programs by Lift and Project , 1998, IPCO.
[26] Hanif D. Sherali,et al. Optimization with disjunctive constraints , 1980 .
[27] Robert G. Jeroslow,et al. Cutting-Plane Theory: Disjunctive Methods , 1977 .