Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
暂无分享,去创建一个
[1] Hanif D. Sherali,et al. A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..
[2] Hanif D. Sherali,et al. Tighter Representations for Set Partitioning Problems , 1996, Discret. Appl. Math..
[3] E. Balas,et al. Facets of the Knapsack Polytope From Minimal Covers , 1978 .
[4] Hanif D. Sherali,et al. Mixed-integer bilinear programming problems , 1993, Math. Program..
[5] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[6] Hanif D. Sherali,et al. Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems , 1990, Oper. Res..
[7] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[8] E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .
[9] Hanif D. Sherali,et al. Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes , 1995, SIAM J. Discret. Math..
[10] Hanif D. Sherali,et al. A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..
[11] Warren P. Adams,et al. A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .
[12] Hanif D. Sherali,et al. A reformulation-convexification approach for solving nonconvex quadratic programming problems , 1995, J. Glob. Optim..
[13] Laurence A. Wolsey,et al. Valid inequalities for 0-1 knapsacks and mips with generalised upper bound constraints , 1990, Discret. Appl. Math..
[14] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[15] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..