In Memoriam: Shabbir Ahmed (1969–2019)

Published Online:https://doi.org/10.1287/ijoc.2019.0931

References

  • Ahmed S, Tawarmalani M, Sahinidis NV (2004) A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math. Programming 100(2):355–377.CrossrefGoogle Scholar
  • Ahmed S, Gozbasi O, Savelsbergh M, Crocker I, Fox T, Schreibmann E (2010) An automated intensity-modulated radiation therapy planning system. INFORMS J. Comput. 22(4):568–583.LinkGoogle Scholar
  • Angulo G, Ahmed S, Dey SS (2016) Improving the integer L-shaped method. INFORMS J. Comput. 28(3):483–499.LinkGoogle Scholar
  • Deng Y, Ahmed S, Shen S (2018) Parallel scenario decomposition of risk averse 0-1 stochastic programs. INFORMS J. Comput. 30(1):90–105.LinkGoogle Scholar
  • Parija G, Ahmed S, King AJ (2004) On bridging the gap between stochastic integer programming and mixed-integer solver technologies. INFORMS J. Comput. 16(1):73–83.LinkGoogle Scholar
  • Qiu F, Ahmed S, Dey SS, Wolsey L (2014) Covering linear programming with violations. INFORMS J. Comput. 26(3):531–546.LinkGoogle Scholar
  • Santoso T, Ahmed S, Goetschalckx M, Shapiro A (2005) A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1):96–115.CrossrefGoogle Scholar
  • Verweij B, Ahmed S, Kleywegt AJ, Nemhauser G, Shapiro A (2003) The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. 24(2–3):289–333.CrossrefGoogle Scholar
  • Vielma JP, Ahmed S, Nemhauser GL (2008) A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs. INFORMS J. Comput. 20(3):438–450.LinkGoogle Scholar
  • Vielma JP, Ahmed S, Nemhauser GL (2010) A note on: “A superior representation method for piecewise linear functions.” INFORMS J. Comput. 22(3):493–497.LinkGoogle Scholar
  • Zou J, Ahmed S, Sun X (2018) Partially adaptive stochastic optimization for electric power generation expansion planning. INFORMS J. Comput. 30(2):388–401.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.