H
Hanif D. Sherali
Researcher at Virginia Tech
Publications - 411
Citations - 21346
Hanif D. Sherali is an academic researcher from Virginia Tech. The author has contributed to research in topics: Linear programming & Wireless network. The author has an hindex of 68, co-authored 410 publications receiving 20218 citations. Previous affiliations of Hanif D. Sherali include Clemson University & Georgia Institute of Technology.
Papers
More filters
Book
Linear Programming and Network Flows
TL;DR: This chapter discusses the complexity of the Simplex Algorithms and their applications in linear algebra, convex analysis, and Polyhedral Sets.
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
On energy provisioning and relay node placement for wireless sensor networks
TL;DR: A heuristic algorithm, called Smart Pairing and INtelligent Disc Search (SPINDS), is developed that effectively transform a complex MINLP problem into a linear programming (LP) problem without losing critical points in its search space.
Journal ArticleDOI
A new reformulation-linearization technique for bilinear programming problems
TL;DR: This paper is concerned with the development of an algorithm for general bilinear programming problems, and develops a new Reformulation-Linearization Technique (RLT) for this problem, and imbeds it within a provably convergent branch-and-bound algorithm.