IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v31y2019i4p633-635.html
   My bibliography  Save this article

In Memoriam: Shabbir Ahmed (1969–2019)

Author

Listed:
  • J. Cole Smith

    (Department of Industrial Engineering, Clemson University, Clemson, South Carolina 29631)

Abstract

No abstract is available for this item.

Suggested Citation

  • J. Cole Smith, 2019. "In Memoriam: Shabbir Ahmed (1969–2019)," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 633-635, October.
    • Handle: RePEc:inm:orijoc:v:31:y:2019:i:4:p:633-635
    DOI: 10.1287/ijoc.2019.0931
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2019.0931
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2019.0931?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Juan Pablo Vielma & Shabbir Ahmed & George L. Nemhauser, 2008. "A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 438-450, August.
    2. Yan Deng & Shabbir Ahmed & Siqian Shen, 2018. "Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 90-105, February.
    3. QIU, Feng & AHMED, Shabbir & DEY, Santanu S & WOLSEY, Laurence A, 2014. "Covering linear programming with violations," LIDAM Reprints CORE 2618, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Shabbir Ahmed & Ozan Gozbasi & Martin Savelsbergh & Ian Crocker & Tim Fox & Eduard Schreibmann, 2010. "An Automated Intensity-Modulated Radiation Therapy Planning System," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 568-583, November.
    5. Feng Qiu & Shabbir Ahmed & Santanu S. Dey & Laurence A. Wolsey, 2014. "Covering Linear Programming with Violations," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 531-546, August.
    6. Gustavo Angulo & Shabbir Ahmed & Santanu S. Dey, 2016. "Improving the Integer L-Shaped Method," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 483-499, August.
    7. Gyana R. Parija & Shabbir Ahmed & Alan J. King, 2004. "On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 73-83, February.
    8. Juan Pablo Vielma & Shabbir Ahmed & George Nemhauser, 2010. "A Note on “A Superior Representation Method for Piecewise Linear Functions”," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 493-497, August.
    9. Santoso, Tjendera & Ahmed, Shabbir & Goetschalckx, Marc & Shapiro, Alexander, 2005. "A stochastic programming approach for supply chain network design under uncertainty," European Journal of Operational Research, Elsevier, vol. 167(1), pages 96-115, November.
    10. Jikai Zou & Shabbir Ahmed & Xu Andy Sun, 2018. "Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 388-401, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kevin Ryan & Shabbir Ahmed & Santanu S. Dey & Deepak Rajan & Amelia Musselman & Jean-Paul Watson, 2020. "Optimization-Driven Scenario Grouping," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 805-821, July.
    2. Xueting Cui & Xiaoling Sun & Shushang Zhu & Rujun Jiang & Duan Li, 2018. "Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 454-471, August.
    3. Chen, Liang & Chen, Sheng-Jie & Chen, Wei-Kun & Dai, Yu-Hong & Quan, Tao & Chen, Juan, 2023. "Efficient presolving methods for solving maximal covering and partial set covering location problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 73-87.
    4. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    5. Álvaro Porras & Concepción Domínguez & Juan Miguel Morales & Salvador Pineda, 2023. "Tight and Compact Sample Average Approximation for Joint Chance-Constrained Problems with Applications to Optimal Power Flow," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1454-1469, November.
    6. Zhouchun Huang & Qipeng P. Zheng & Andrew L. Liu, 2022. "A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1919-1939, July.
    7. Xiaodi Bai & Jie Sun & Xiaojin Zheng, 2021. "An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1056-1069, July.
    8. Lu, Mengshi & Nakao, Hideaki & Shen, Siqian & Zhao, Lin, 2021. "Non-profit resource allocation and service scheduling with cross-subsidization and uncertain resource consumptions," Omega, Elsevier, vol. 99(C).
    9. Yongjia Song & James R. Luedtke & Simge Küçükyavuz, 2014. "Chance-Constrained Binary Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 735-747, November.
    10. Ursavas, Evrim, 2017. "A benders decomposition approach for solving the offshore wind farm installation planning at the North Sea," European Journal of Operational Research, Elsevier, vol. 258(2), pages 703-714.
    11. Zheng Zhang & Brian T. Denton & Xiaolan Xie, 2020. "Branch and Price for Chance-Constrained Bin Packing," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 547-564, July.
    12. Weijun Xie & Shabbir Ahmed, 2020. "Bicriteria Approximation of Chance-Constrained Covering Problems," Operations Research, INFORMS, vol. 68(2), pages 516-533, March.
    13. Siqian Shen & Mingdi You & Yintai Ma, 2017. "Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(2), pages 154-173, March.
    14. Shanshan Wang & Jinlin Li & Sanjay Mehrotra, 2021. "Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1661-1677, October.
    15. Yan Deng & Huiwen Jia & Shabbir Ahmed & Jon Lee & Siqian Shen, 2021. "Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 757-773, May.
    16. Zhouchun Huang & Qipeng Phil Zheng & Eduardo Pasiliao & Vladimir Boginski & Tao Zhang, 2019. "A cutting plane method for risk-constrained traveling salesman problem with random arc costs," Journal of Global Optimization, Springer, vol. 74(4), pages 839-859, August.
    17. Lin, Cheng-Chang & Wu, Yi-Chen, 2013. "Optimal pricing for build-to-order supply chain design under price-dependent stochastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 31-49.
    18. M. Jenabi & S. M. T. Fatemi Ghomi & S. A. Torabi & Moeen Sammak Jalali, 2022. "An accelerated Benders decomposition algorithm for stochastic power system expansion planning using sample average approximation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1304-1336, December.
    19. Ahumada, Omar & Rene Villalobos, J. & Nicholas Mason, A., 2012. "Tactical planning of the production and distribution of fresh agricultural products under uncertainty," Agricultural Systems, Elsevier, vol. 112(C), pages 17-26.
    20. Fan, Lei & Wilson, William W. & Dahl, Bruce, 2015. "Risk analysis in port competition for containerized imports," European Journal of Operational Research, Elsevier, vol. 245(3), pages 743-753.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:31:y:2019:i:4:p:633-635. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.