Lifting inequalities: a framework for generating strong cuts for nonlinear programs
暂无分享,去创建一个
[1] Robert E. Bixby,et al. MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.
[2] Martin W. P. Savelsbergh,et al. Sequence Independent Lifting in Mixed Integer Programming , 2000, J. Comb. Optim..
[3] Laurence A. Wolsey,et al. Valid Linear Inequalities for Fixed Charge Problems , 1985, Oper. Res..
[4] Nikolaos V. Sahinidis,et al. Convex extensions and envelopes of lower semi-continuous functions , 2002, Math. Program..
[5] Egon Balas,et al. Facets of the knapsack polytope , 1975, Math. Program..
[6] Alper Atamtürk,et al. On the facets of the mixed–integer knapsack polyhedron , 2003, Math. Program..
[7] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[8] Dieter Vandenbussche,et al. Box-constrained quadratic programs with fixed charge variables , 2008, J. Glob. Optim..
[9] 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..
[10] Manfred W. Padberg,et al. On the facial structure of set packing polyhedra , 1973, Math. Program..
[11] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[12] Laurence A. Wolsey,et al. Faces for a linear inequality in 0–1 variables , 1975, Math. Program..
[13] George L. Nemhauser,et al. Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms , 2002, IPCO.
[14] W. Art Chaovalitwongse,et al. A new linearization technique for multi-quadratic 0-1 programming problems , 2004, Oper. Res. Lett..
[15] Warren P. Adams,et al. A hierarchy of relaxation between the continuous and convex hull representations , 1990 .
[16] S. Janson,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[17] George L. Nemhauser,et al. Facets of the Complementarity Knapsack Polytope , 2002, Math. Oper. Res..
[18] Richard Laundy,et al. Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study , 2009, INFORMS J. Comput..
[19] E. Balas. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .
[20] Fred W. Glover,et al. Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..
[21] Sebastián Ceria,et al. Convex programming for disjunctive convex optimization , 1999, Math. Program..
[22] Robert E. Bixby,et al. Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.
[23] Egon Balas,et al. programming: Properties of the convex hull of feasible points * , 1998 .
[24] Sanjay Mehrotra,et al. A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..
[25] Warren P. Adams,et al. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .
[26] Laurence A. Wolsey,et al. A recursive procedure to generate all cuts for 0–1 mixed integer programs , 1990, Math. Program..
[27] Alper Atamtürk,et al. Flow pack facets of the single node fixed-charge flow polytope , 2001, Oper. Res. Lett..
[28] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[29] D. Luenberger. Optimization by Vector Space Methods , 1968 .
[30] Diego Klabjan,et al. Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds , 2006, Math. Program..
[31] Hanif D. Sherali,et al. A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..
[32] Laurence A. Wolsey,et al. Lifting, superadditivity, mixed integer rounding and single node flow sets revisited , 2003, 4OR.
[33] George L. Nemhauser,et al. A polyhedral study of nonconvex quadratic programs with box constraints , 2005, Math. Program..
[34] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[35] J. Hiriart-Urruty,et al. Fundamentals of Convex Analysis , 2004 .
[36] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[37] Hanif D. Sherali,et al. A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..
[38] Laurence A. Wolsey,et al. The 0-1 Knapsack problem with a single continuous variable , 1999, Math. Program..
[39] Laurence A. Wolsey,et al. Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..
[40] Peter L. Hammer,et al. Facet of regular 0–1 polytopes , 1975, Math. Program..
[41] Laurence A. Wolsey,et al. Valid Inequalities and Superadditivity for 0-1 Integer Programs , 1977, Math. Oper. Res..
[42] Martin W. P. Savelsbergh,et al. Lifted flow cover inequalities for mixed 0-1 integer programs , 1999, Math. Program..
[43] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[44] L. Wolsey,et al. Valid inequalities and separation for uncapacitated fixed charge networks , 1985 .
[45] Laurence A. Wolsey,et al. Aggregation and Mixed Integer Rounding to Solve MIPs , 2001, Oper. Res..