| A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems HD Sherali, WP Adams SIAM Journal on Discrete Mathematics 3 (3), 411-430, 1990 | 1189 | 1990 |
| A reformulation-linearization technique for solving discrete and continuous nonconvex problems HD Sherali, WP Adams Springer Science & Business Media, 2013 | 1015 | 2013 |
| A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problems HD Sherali, WP Adams Discrete Applied Mathematics 52 (1), 83-106, 1994 | 385 | 1994 |
| A tight linearization and an algorithm for zero-one quadratic programming problems WP Adams, HD Sherali Management Science 32 (10), 1274-1290, 1986 | 382 | 1986 |
| Improved linear programming based lower bounds for the quadratic assignment problem WP Adams Quadratic assignment and related problems, DIMACS series in discrete …, 1994 | 269 | 1994 |
| Linearization strategies for a class of zero-one mixed integer programming problems WP Adams, HD Sherali Operations Research 38 (2), 217-226, 1990 | 232 | 1990 |
| Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems HD Sherali, WP Adams, PJ Driscoll Operations Research 46 (3), 396-405, 1998 | 150 | 1998 |
| Mixed-integer bilinear programming problems WP Adams, HD Sherali Mathematical Programming 59, 279-305, 1993 | 144 | 1993 |
| A level-2 reformulation–linearization technique bound for the quadratic assignment problem WP Adams, M Guignard, PM Hahn, WL Hightower European Journal of Operational Research 180 (3), 983-996, 2007 | 133 | 2007 |
| Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs WP Adams, RJ Forrester, FW Glover Discrete Optimization 1 (2), 99-120, 2004 | 129 | 2004 |
| A simple recipe for concise mixed 0-1 linearizations WP Adams, RJ Forrester Operations research letters 33 (1), 55-61, 2005 | 95 | 2005 |
| Reformulation-linearization techniques for discrete optimization problems HD Sherali, WP Adams Handbook of Combinatorial Optimization: Volume1–3, 479-532, 1998 | 73 | 1998 |
| A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems WP Adams, HD Sherali Annals of Operations Research 140, 21-47, 2005 | 57 | 2005 |
| A decomposition algorithm for a discrete location-allocation problem HD Sherali, WP Adams Operations research 32 (4), 878-900, 1984 | 54 | 1984 |
| Linear forms of nonlinear expressions: New insights on old ideas WP Adams, RJ Forrester Operations research letters 35 (4), 510-518, 2007 | 53 | 2007 |
| On the equivalence between roof duality and Lagrangian duality for unconstrained 0–1 quadratic programming problems WP Adams, PM Dearing Discrete Applied Mathematics 48 (1), 1-20, 1994 | 44 | 1994 |
| Base-2 expansions for linearizing products of functions of discrete variables WP Adams, SM Henry Operations research 60 (6), 1477-1490, 2012 | 38 | 2012 |
| A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope HD Sherali, Y Lee, WP Adams Operations Research Letters 17 (1), 19-26, 1995 | 38 | 1995 |
| A reformulation-linearization technique (rlt) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions HD Sherali, WP Adams Discrete Applied Mathematics 157 (6), 1319-1333, 2009 | 29 | 2009 |
| Unconstrained 0–1 optimization and Lagrangean relaxation WE Adams, A Billionnet, A Sutter Discrete Applied Mathematics 29 (2-3), 131-142, 1990 | 28 | 1990 |
