The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hanif D. Sherali: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shiwen Mao, Xiaolin Cheng, Yiwei Thomas Hou, Hanif D. Sherali
    Multiple Description Video Multicast in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    BROADNETS, 2004, pp:671-680 [Conf]
  2. Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali, Jeffrey E. Wieselthier
    Online lifetime-centric multicast routing for ad hoc networks with directional antennas. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:761-772 [Conf]
  3. Shiwen Mao, Yiwei Thomas Hou, Xiaolin Cheng, Hanif D. Sherali, Scott F. Midkiff
    Multipath routing for multiple description video in wireless ad hoc networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:740-750 [Conf]
  4. Yi Shi, Yiwei Thomas Hou, Hanif D. Sherali, Scott F. Midkiff
    Cross-layer optimization for routing data traffic in UWB-based sensor networks. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 2005, pp:299-312 [Conf]
  5. Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
    Rate allocation in wireless sensor networks with network lifetime requirement. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2004, pp:67-77 [Conf]
  6. Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
    On Base Station Selection for Anycast Flow Routing in Energy-Constrained Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    QSHINE, 2005, pp:8- [Conf]
  7. Shirish S. Joshi, Hanif D. Sherali, Jeffrey D. Tew
    An enhanced RSM algorithm using gradient-deflection and second-order search strategies. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 1994, pp:297-304 [Conf]
  8. Shirish S. Joshi, Hanif D. Sherali, Jeffrey D. Tew
    An enhanced response surface methodology (RSM) algorithm using gradient deflection and second-order search strategies. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1998, v:25, n:7-8, pp:531-541 [Journal]
  9. Seong-In Kim, Hanif D. Sherali, Heung-Sun Park
    Minisum and minimax paths of a moving facility on a network. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1992, v:19, n:2, pp:123-131 [Journal]
  10. Qing Li, Hanif D. Sherali
    An approach for analyzing foreign direct investment projects with application to China's Tumen River Area development. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:10, pp:1467-1485 [Journal]
  11. Hanif D. Sherali, Gyunghyun Choi
    Finding the closest point to the origin in the convex hull of a discrete set of points. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1993, v:20, n:4, pp:363-370 [Journal]
  12. Hanif D. Sherali, S. Elizabeth Dickey
    An extreme-point-ranking algorithm for the extreme-point mathematical programming problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1986, v:13, n:4, pp:465-475 [Journal]
  13. Hanif D. Sherali, Burak Özdaryal, Warren P. Adams, Naguib Attia
    On using exterior penalty approaches for solving linear programming problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2001, v:28, n:11, pp:1049-1074 [Journal]
  14. Hanif D. Sherali, P. Rajgopal
    A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1986, v:13, n:5, pp:587-600 [Journal]
  15. Hanif D. Sherali, Konstantin Staschus
    A nonlinear hierarchical approach for incorporating solar generation units in electric utility capacity expansion plans. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1985, v:12, n:2, pp:181-199 [Journal]
  16. Hanif D. Sherali, Allen L. Soyster
    Convergence analysis and algorithmic implications of two dynamic processes toward an oligopolycompetitive fringe equilibrium solution. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1988, v:15, n:1, pp:69-81 [Journal]
  17. Hanif D. Sherali, Warren P. Adams
    A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:52, n:1, pp:83-106 [Journal]
  18. Hanif D. Sherali, Youngho Lee
    Tighter Representations for Set Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:153-167 [Journal]
  19. Hanif D. Sherali, Sridhar Ramachandran, Seong-In Kim
    A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:49, n:1-3, pp:357-378 [Journal]
  20. Hanif D. Sherali, Jonathan Cole Smith
    A class of web-based facets for the generalized vertex packing problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:3, pp:273-286 [Journal]
  21. Hanif D. Sherali, Jonathan Cole Smith, Warren P. Adams
    Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:247-267 [Journal]
  22. Hanif D. Sherali, Qing Li
    A Game Theoretic Analysis of Mechanisms to Induce Regional Technological Cooperation. [Citation Graph (0, 0)][DBLP]
    Informatica, Lith. Acad. Sci., 2000, v:11, n:2, pp:179-194 [Journal]
  23. Hanif D. Sherali, Jonathan Cole Smith, Youngho Lee
    Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:4, pp:284-298 [Journal]
  24. Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
    On Node Lifetime Problem for Energy-Constrained Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2005, v:10, n:6, pp:865-878 [Journal]
  25. Shiwen Mao, Xiaolin Cheng, Yiwei Thomas Hou, Hanif D. Sherali
    Multiple Description Video Multicast in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2006, v:11, n:1, pp:63-73 [Journal]
  26. Warren P. Adams, Hanif D. Sherali
    Mixed-integer bilinear programming problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:59, n:, pp:279-305 [Journal]
  27. Suvrajeet Sen, Hanif D. Sherali
    Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:106, n:2, pp:203-223 [Journal]
  28. Hanif D. Sherali
    Capacitated, balanced, sequential location-allocation problems on chains and trees. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:49, n:, pp:381-396 [Journal]
  29. Hanif D. Sherali, Jonathan Cole Smith
    A polyhedral study of the generalized vertex packing problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:107, n:3, pp:367-390 [Journal]
  30. Hanif D. Sherali, Xiaomei Zhu
    On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:108, n:2-3, pp:597-616 [Journal]
  31. Youngho Lee, Hanif D. Sherali, Junghee Han, Seong-In Kim
    A branch-and-cut algorithm for solving an intraring synchronous optical network design problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:3, pp:223-232 [Journal]
  32. Hanif D. Sherali, Kaan Ozbay, Shivaram Subramanian
    The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:4, pp:259-272 [Journal]
  33. Hanif D. Sherali, Chawalit Jeenanunta, Antoine G. Hobeika
    The approach-dependent, time-dependent, label-constrained shortest path problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:2, pp:57-67 [Journal]
  34. Fred Glover, Hanif D. Sherali
    Foundation-penalty cuts for mixed-integer programs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:3, pp:245-253 [Journal]
  35. Hanif D. Sherali
    On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:28, n:4, pp:155-160 [Journal]
  36. Hanif D. Sherali, Gyunghyun Choi, Cihan H. Tuncbilek
    A variable target value method for nondifferentiable optimization. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:1, pp:1-8 [Journal]
  37. Hanif D. Sherali, Churlzu Lim
    On embedding the volume algorithm in a variable target value method. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:455-462 [Journal]
  38. Hanif D. Sherali, Cihan H. Tuncbilek
    New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1997, v:21, n:1, pp:1-9 [Journal]
  39. Subhash C. Sarin, Hanif D. Sherali, Ajay Bhootra
    New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:1, pp:62-70 [Journal]
  40. Hanif D. Sherali, Youngho Lee
    Sequential and Simultaneous Liftings of Minimal Cover Inequalitiesfor Generalized Upper Bound Constrained Knapsack Polytopes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:1, pp:133-153 [Journal]
  41. Hanif D. Sherali, Warren P. Adams
    A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:411-430 [Journal]
  42. Hanif D. Sherali, Ebru K. Bish, Xiaomei Zhu
    Airline fleet assignment concepts, models, and algorithms. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:172, n:1, pp:1-30 [Journal]
  43. Salem M. Al-Yakoob, Hanif D. Sherali
    Mathematical programming models and algorithms for a class-faculty assignment problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2006, v:173, n:2, pp:488-507 [Journal]
  44. Salem M. Al-Yakoob, Hanif D. Sherali
    A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:180, n:3, pp:1028-1044 [Journal]
  45. Hanif D. Sherali, Youngho Lee, Youngjin Kim
    Partial convexification cuts for 0-1 mixed-integer programs. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:165, n:3, pp:625-648 [Journal]
  46. Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
    Optimal Spectrum Sharing for Multi-Hop Software Defined Radio Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1-9 [Conf]
  47. Jia Liu, Y. Thomas Hou, Yi Shi, Hanif D. Sherali
    Optimization of Multiuser MIMO Networks with Interference. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  48. Jia Liu, Y. Thomas Hou, Hanif D. Sherali
    Conjugate Gradient Projection Approach for Multi-Antenna Gaussian Broadcast Channels [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  49. Salem M. Al-Yakoob, Hanif D. Sherali
    Multiple Shift Scheduling of Hierarchical Workforce with Multiple Work Centers. [Citation Graph (0, 0)][DBLP]
    Informatica, Lith. Acad. Sci., 2007, v:18, n:3, pp:325-342 [Journal]

  50. Routing and Power Allocation for MIMO-Based Ad Hoc Networks with Dirty Paper Coding. [Citation Graph (, )][DBLP]


  51. On the Maximum Weighted Sum-Rate of MIMO Gaussian Broadcast Channels. [Citation Graph (, )][DBLP]


  52. Cooperative Communications in Multi-hop Wireless Networks: Joint Flow Routing and Relay Node Assignment. [Citation Graph (, )][DBLP]


  53. On performance optimization for multi-carrier MIMO ad hoc networks. [Citation Graph (, )][DBLP]


  54. Optimal Scheduling in Interference Limited Fading Wireless Networks. [Citation Graph (, )][DBLP]


  55. A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints. [Citation Graph (, )][DBLP]


  56. Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs. [Citation Graph (, )][DBLP]


  57. A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002