W
Warren P. Adams
Researcher at Clemson University
Publications - 38
Citations - 3336
Warren P. Adams is an academic researcher from Clemson University. The author has contributed to research in topics: Convex hull & Linearization. The author has an hindex of 19, co-authored 37 publications receiving 3116 citations. Previous affiliations of Warren P. Adams include Virginia Tech.
Papers
More filters
Journal ArticleDOI
A hierarchy of relaxation between the continuous and convex hull representations
Hanif D. Sherali,Warren P. Adams +1 more
TL;DR: In this paper, a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a zero one polynomial programming problem and then relinearizes it into an extended linear program.
Book
A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Hanif D. Sherali,Warren P. Adams +1 more
TL;DR: This paper presents RLT-Based Global Optimization Algorithms for Nonconvex Polynomial Programming Problems and Reformulation-Convexification Technique for Polynomials Programs: Design and Implementation, and some special applications to Discrete and Continuous Non Convex Programs.
Journal ArticleDOI
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems
Hanif D. Sherali,Warren P. Adams +1 more
TL;DR: This paper proposes a technique which first converts the problem into a nonlinear, polynomial mixed-integer zero-one problem by multiplying the constraints with some suitable d-degree polynometric factors involving the n binary variables, and subsequently linearizes the resulting problem through appropriate variable transformations.
Journal ArticleDOI
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
Warren P. Adams,Hanif D. Sherali +1 more
TL;DR: A new linearization technique is presented for the solution of linearly constrained zero-one quadratic programming problems, demonstrated to yield a tighter continuous or linear programming relaxation than is available through other methods.
Journal ArticleDOI
Linearization strategies for a class of zero-one mixed integer programming problems
Warren P. Adams,Hanif D. Sherali +1 more
TL;DR: This linearization scheme provides an equivalent mixed integer linear programming problem which yields a tighter continuous relaxation than that obtainable via the alternative linearization techniques available in the literature.