Global Optimization of 0-1 Hyperbolic Programs. - Mohit Tawarmalani; Shabbir Ahmed 001; Nikolaos V. Sahinidis (J. Glob. Optim., 2002)

Dynamic Capacity Acquisition and Assignment under Uncertainty. - Shabbir Ahmed 001; Renan Garcia (Ann. Oper. Res., 2003)

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study. - Bram Verweij; Shabbir Ahmed 001; Anton J. Kleywegt; George L. Nemhauser; Alexander Shapiro 001 (Comput. Optim. Appl., 2003)

An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion. - Shabbir Ahmed 001; Nikolaos V. Sahinidis (Oper. Res., 2003)

A Multi-Stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty. - Shabbir Ahmed 001; Alan J. King; Gyana R. Parija (J. Glob. Optim., 2003)

On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies. - Gyana R. Parija; Shabbir Ahmed 001; Alan J. King (INFORMS J. Comput., 2004)

A finite branch-and-bound algorithm for two-stage stochastic integer programs. - Shabbir Ahmed 001; Mohit Tawarmalani; Nikolaos V. Sahinidis (Math. Program., 2004)

On robust optimization of two-stage systems. - Samer Takriti; Shabbir Ahmed 001 (Math. Program., 2004)

On a Class of Minimax Stochastic Programs. - Alexander Shapiro 001; Shabbir Ahmed 001 (SIAM J. Optim., 2004)

A stochastic programming approach for supply chain network design under uncertainty. - Tjendera Santoso; Shabbir Ahmed 001; Marc Goetschalckx; Alexander Shapiro 001 (Eur. J. Oper. Res., 2005)

The inverse optimal value problem. - Shabbir Ahmed 001; Yongpei Guan (Math. Program., 2005)

Global Optimization of Probabilistically Constrained Linear Programs. - Shabbir Ahmed 001 (CP, 2006)

Convexity and decomposition of mean-risk stochastic programs. - Shabbir Ahmed 001 (Math. Program., 2006)

A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs. - Myun-Seok Cheon; Shabbir Ahmed 001; Faiz A. Al-Khayyal (Math. Program., 2006)

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. - Yongpei Guan; Shabbir Ahmed 001; George L. Nemhauser; Andrew J. Miller (Math. Program., 2006)

On formulations of the stochastic uncapacitated lot-sizing problem. - Yongpei Guan; Shabbir Ahmed 001; Andrew J. Miller; George L. Nemhauser (Oper. Res. Lett., 2006)

Sequential pairing of mixed integer inequalities. - Yongpei Guan; Shabbir Ahmed 001; George L. Nemhauser (Discret. Optim., 2007)

Coherent risk measures in inventory problems. - Shabbir Ahmed 001; Ulas Çakmak; Alexander Shapiro 001 (Eur. J. Oper. Res., 2007)

Selection, acquisition, and allocation of manufacturing technology in a multi-period environment. - Shabbir Ahmed 001; Nikolaos V. Sahinidis (Eur. J. Oper. Res., 2008)

On a Multi-stage Stochastic Programming Model for Inventory Planning. - Kai Huang; Shabbir Ahmed 001 (INFOR Inf. Syst. Oper. Res., 2008)

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (INFORMS J. Comput., 2008)

A note on natural risk statistics. - Shabbir Ahmed 001; Damir Filipovic; Gregor Svindland (Oper. Res. Lett., 2008)

Sample average approximation of expected value constrained stochastic programs. - Wei Wang; Shabbir Ahmed 001 (Oper. Res. Lett., 2008)

A Sample Approximation Approach for Optimization with Probabilistic Constraints. - James R. Luedtke; Shabbir Ahmed 001 (SIAM J. Optim., 2008)

Cutting plane algorithms for solving a stochastic edge-partition problem. - Z. Caner Taskin; J. Cole Smith; Shabbir Ahmed 001; Andrew J. Schaefer (Discret. Optim., 2009)

Supply chain design under uncertainty using sample average approximation and dual decomposition. - Peter Schütz; Asgeir Tomasgard; Shabbir Ahmed 001 (Eur. J. Oper. Res., 2009)

Cutting Planes for Multistage Stochastic Integer Programs. - Yongpei Guan; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res., 2009)

The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty. - Kai Huang; Shabbir Ahmed 001 (Oper. Res., 2009)

Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications. - Bernardo K. Pagnoncelli; Shabbir Ahmed 001; Alexander Shapiro 001 (J. Optimization Theory and Applications, 2009)

Approximating the stability region for binary mixed-integer programs. - Fatma Kilinç-Karzan; Alejandro Toriello; Shabbir Ahmed 001; George L. Nemhauser; Martin W. P. Savelsbergh (Oper. Res. Lett., 2009)

Chemical Process Planning. - Shabbir Ahmed 001; Nikolaos V. Sahinidis (Encyclopedia of Optimization, 2009)

A stochastic programming approach for planning horizons of infinite horizon capacity planning problems. - Kai Huang; Shabbir Ahmed 001 (Eur. J. Oper. Res., 2010)

An Automated Intensity-Modulated Radiation Therapy Planning System. - Shabbir Ahmed 001; Ozan Gozbasi; Martin W. P. Savelsbergh; Ian Crocker; Tim Fox; Eduard Schreibmann (INFORMS J. Comput., 2010)

A Note on "A Superior Representation Method for Piecewise Linear Functions". - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (INFORMS J. Comput., 2010)

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res., 2010)

Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths. - Siqian Shen; J. Cole Smith; Shabbir Ahmed 001 (Manag. Sci., 2010)

An integer programming approach for linear programs with probabilistic constraints. - James R. Luedtke; Shabbir Ahmed 001; George L. Nemhauser (Math. Program., 2010)

Maximizing a class of submodular utility functions. - Shabbir Ahmed 001; Alper Atamtürk (Math. Program., 2011)

A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs. - Qie He; Shabbir Ahmed 001; George L. Nemhauser (SIAM J. Optim., 2011)

Sell or Hold: A simple two-stage stochastic combinatorial optimization problem. - Qie He; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res. Lett., 2012)

Mixed integer linear programming formulations for probabilistic constraints. - Juan Pablo Vielma; Shabbir Ahmed 001; George L. Nemhauser (Oper. Res. Lett., 2012)

Probabilistic Set Covering with Correlations. - Shabbir Ahmed 001; Dimitri J. Papageorgiou (Oper. Res., 2013)

Totally unimodular stochastic programs. - Nan Kong; Andrew J. Schaefer; Shabbir Ahmed 001 (Math. Program., 2013)

A scenario decomposition algorithm for 0-1 stochastic programs. - Shabbir Ahmed 001 (Oper. Res. Lett., 2013)

Solving Mixed Integer Bilinear Problems Using MILP Formulations. - Akshay Gupte; Shabbir Ahmed 001; Myun-Seok Cheon; Santanu S. Dey (SIAM J. Optim., 2013)

Congestion-aware dynamic routing in automated material handling systems. - Kelly Bartlett; Junho Lee; Shabbir Ahmed 001; George L. Nemhauser; Joel S. Sokol; Byungsoo Na (Comput. Ind. Eng., 2014)

Covering Linear Programming with Violations. - Feng Qiu; Shabbir Ahmed 001; Santanu S. Dey; Laurence A. Wolsey (INFORMS J. Comput., 2014)

Semi-continuous network flow problems. - Gustavo Angulo; Shabbir Ahmed 001; Santanu S. Dey (Math. Program., 2014)

Convex relaxations of chance constrained optimization problems. - Shabbir Ahmed 001 (Optim. Lett., 2014)

Using diversification, communication and parallelism to solve mixed-integer linear programs. - Rodolfo Carvajal; Shabbir Ahmed 001; George L. Nemhauser; Kevin C. Furman; Vikas Goel; Yufen Shao (Oper. Res. Lett., 2014)

A cutting and scheduling problem in float glass manufacturing. - Byungsoo Na; Shabbir Ahmed 001; George L. Nemhauser; Joel S. Sokol (J. Sched., 2014)

The Robust Redundancy Allocation Problem in Series-Parallel Systems With Budgeted Uncertainty. - Mohammad Javad Feizollahi; Shabbir Ahmed 001; Mohammad Modarres (IEEE Trans. Reliab., 2014)

Forbidden Vertices. - Gustavo Angulo; Shabbir Ahmed 001; Santanu S. Dey; Volker Kaibel (Math. Oper. Res., 2015)

Minimum concave cost flow over a grid network. - Qie He; Shabbir Ahmed 001; George L. Nemhauser (Math. Program., 2015)

Corrigendum to "A scenario decomposition algorithm for 0-1 stochastic programs" [Oper. Res. Lett. 41(6) (2013) 565-569]. - Shabbir Ahmed 001 (Oper. Res. Lett., 2015)

On the Quantile Cut Closure of Chance-Constrained Problems. - Weijun Xie 001; Shabbir Ahmed 001 (IPCO, 2016)

Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation. - Kevin Ryan; Deepak Rajan; Shabbir Ahmed 001 (IPDPS Workshops, 2016)

Strengthened bounds for the probability of k-out-of-n events. - Feng Qiu; Shabbir Ahmed 001; Santanu S. Dey (Discret. Appl. Math., 2016)

Risk neutral and risk averse approaches to multistage renewable investment planning under uncertainty. - Sergio Bruno; Shabbir Ahmed 001; Alexander Shapiro 001; Alexandre Street (Eur. J. Oper. Res., 2016)

Improving the Integer L-Shaped Method. - Gustavo Angulo; Shabbir Ahmed 001; Santanu S. Dey (INFORMS J. Comput., 2016)

Maximizing expected utility over a knapsack constraint. - Jiajin Yu; Shabbir Ahmed 001 (Oper. Res. Lett., 2016)

On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid. - Shabbir Ahmed 001; Qie He; Shi Li 001; George L. Nemhauser (SIAM J. Optim., 2016)

Learning to Run Heuristics in Tree Search. - Elias B. Khalil; Bistra Dilkina; George L. Nemhauser; Shabbir Ahmed 001; Yufen Shao (IJCAI, 2017)

A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem. - Lluís-Miquel Munguía; Shabbir Ahmed 001; David A. Bader; George L. Nemhauser; Vikas Goel; Yufen Shao (Comput. Oper. Res., 2017)

Polyhedral results for a class of cardinality constrained submodular minimization problems. - Jiajin Yu; Shabbir Ahmed 001 (Discret. Optim., 2017)

A hybrid primal heuristic for finding feasible solutions to mixed integer programs. - Carlos Eduardo de Andrade; Shabbir Ahmed 001; George L. Nemhauser; Yufen Shao (Eur. J. Oper. Res., 2017)

Relaxations and discretizations for the pooling problem. - Akshay Gupte; Shabbir Ahmed 001; Santanu S. Dey; Myun-Seok Cheon (J. Glob. Optim., 2017)

Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs. - Shabbir Ahmed 001; James R. Luedtke; Yongjia Song; Weijun Xie 001 (Math. Program., 2017)

Exact augmented Lagrangian duality for mixed integer linear programming. - Mohammad Javad Feizollahi; Shabbir Ahmed 001; Andy Sun (Math. Program., 2017)

Maximizing a class of submodular utility functions with constraints. - Jiajin Yu; Shabbir Ahmed 001 (Math. Program., 2017)

Distributionally robust simple integer recourse. - Weijun Xie 001; Shabbir Ahmed 001 (Comput. Manag. Sci., 2018)

Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs. - Lluís-Miquel Munguía; Shabbir Ahmed 001; David A. Bader; George L. Nemhauser; Yufen Shao (Comput. Optim. Appl., 2018)

Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation. - Matías Siebert; Kelly Bartlett; Haejoong Kim; Shabbir Ahmed 001; Junho Lee; Dima Nazzal; George L. Nemhauser; Joel Sokol (Int. J. Prod. Res., 2018)

Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs. - Yan Deng; Shabbir Ahmed 001; Siqian Shen (INFORMS J. Comput., 2018)

Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning. - Jikai Zou; Shabbir Ahmed 001; Xu Andy Sun (INFORMS J. Comput., 2018)

Relaxations and approximations of chance constraints under finite distributions. - Shabbir Ahmed 001; Weijun Xie 001 (Math. Program., 2018)

A polyhedral approach to online bipartite matching. - Alfredo Torrico; Shabbir Ahmed 001; Alejandro Toriello (Math. Program., 2018)

On quantile cuts and their closure for chance constrained optimization problems. - Weijun Xie 001; Shabbir Ahmed 001 (Math. Program., 2018)

On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems. - Weijun Xie 001; Shabbir Ahmed 001 (SIAM J. Optim., 2018)

Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing. - Lluís-Miquel Munguía; Shabbir Ahmed 001; David A. Bader; George L. Nemhauser; Yufen Shao; Dimitri J. Papageorgiou (Comput. Oper. Res., 2019)

Robust strategic bidding in auction-based markets. - Bruno Fanzeres; Shabbir Ahmed 001; Alexandre Street (Eur. J. Oper. Res., 2019)

Stochastic dual dynamic integer programming. - Jikai Zou; Shabbir Ahmed 001; Xu Andy Sun (Math. Program., 2019)

A Simulated Annealing Algorithm for the Directed Steiner Tree Problem. - Matías Siebert; Shabbir Ahmed 001; George L. Nemhauser (CoRR, 2020)

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint. - Ezgi Karabulut; Shabbir Ahmed 001; George L. Nemhauser (Discret. Optim., 2020)

Data-driven maintenance and operations scheduling in power systems under decision-dependent uncertainty. - Beste Basciftci; Shabbir Ahmed 001; Nagi Gebraeel (IISE Trans., 2020)

Optimization-Driven Scenario Grouping. - Kevin Ryan; Shabbir Ahmed 001; Santanu S. Dey; Deepak Rajan; Amelia Musselman; Jean-Paul Watson (INFORMS J. Comput., 2020)

The Benders Dual Decomposition Method. - Ragheb Rahmaniani; Shabbir Ahmed 001; Teodor Gabriel Crainic; Michel Gendreau; Walter Rei (Oper. Res., 2020)

Bicriteria Approximation of Chance-Constrained Covering Problems. - Weijun Xie 001; Shabbir Ahmed 001 (Oper. Res., 2020)

A linear programming based approach to the Steiner tree problem with a fixed number of terminals. - Matías Siebert; Shabbir Ahmed 001; George L. Nemhauser (Networks, 2020)

Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming. - Xiaoyi Gu; Shabbir Ahmed 001; Santanu S. Dey (SIAM J. Optim., 2020)

Decentralized online integer programming problems with a coupling cardinality constraint. - Ezgi Karabulut; Shabbir Ahmed 001; George L. Nemhauser (Comput. Oper. Res., 2021)

Distributionally robust facility location problem under decision-dependent stochastic demand. - Beste Basciftci; Shabbir Ahmed 001; Siqian Shen (Eur. J. Oper. Res., 2021)

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs. - Yan Deng; Huiwen Jia; Shabbir Ahmed 001; Jon Lee 001; Siqian Shen (INFORMS J. Comput., 2021)

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems. - Álinson S. Xavier; Feng Qiu; Shabbir Ahmed 001 (INFORMS J. Comput., 2021)

State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems. - Hossein Hashemi Doulabi; Shabbir Ahmed 001; George L. Nemhauser (INFORMS J. Comput., 2022)

Stochastic Lipschitz dynamic programming. - Shabbir Ahmed 001; Filipe Goulart Cabral; Bernardo Freitas Paulo da Costa (Math. Program., 2022)

Decomposition of loosely coupled integer programs: a multiobjective perspective. - Merve Bodur; Shabbir Ahmed 001; Natashia Boland; George L. Nemhauser (Math. Program., 2022)

Optimized Bonferroni approximations of distributionally robust joint chance constraints. - Weijun Xie 001; Shabbir Ahmed 001; Ruiwei Jiang (Math. Program., 2022)

Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making. - Weijun Xie 001; Jie Zhang; Shabbir Ahmed 001 (Math. Program., 2022)

Adaptive Two-Stage Stochastic Programming with an Analysis on Capacity Expansion Planning Problem. - Beste Basciftci; Shabbir Ahmed 001; Nagi Gebraeel (Manuf. Serv. Oper. Manag., 2024)