Convexification techniques for linear complementarity constraints
暂无分享,去创建一个
Jean-Philippe P. Richard | Mohit Tawarmalani | Trang T. Nguyen | Trang T. Nguyen | Mohit Tawarmalani
[1] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .
[2] Egon Balas,et al. A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..
[3] George L. Nemhauser,et al. Facets of the Complementarity Knapsack Polytope , 2002, Math. Oper. Res..
[4] H. Sherali,et al. Enumeration Approach for Linear Complementarity Problems Based on a Reformulation-Linearization Technique , 1998 .
[5] Jing Hu,et al. On linear programs with linear complementarity constraints , 2011, Journal of Global Optimization.
[6] Robert G. Jeroslow,et al. Cutting-Planes for Complementarity Constraints , 1978 .
[7] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[8] George L. Nemhauser,et al. A polyhedral study of nonconvex quadratic programs with box constraints , 2005, Math. Program..
[9] Hanif D. Sherali,et al. A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..
[10] Michael C. Ferris,et al. Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..