Shabbir Ahmed

  • Georgia Institute of Technology, H. Milton Stewart School of Industrial and Systems Engineering, Atlanta, GA, USA

According to our database1, Shabbir Ahmed authored at least 97 papers between 2002 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Optimized Bonferroni approximations of distributionally robust joint chance constraints.
Math. Program., 2022

Stochastic Lipschitz dynamic programming.
Math. Program., 2022

State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems.
INFORMS J. Comput., 2022

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems.
INFORMS J. Comput., 2021

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs.
INFORMS J. Comput., 2021

Distributionally robust facility location problem under decision-dependent stochastic demand.
Eur. J. Oper. Res., 2021

Decentralized online integer programming problems with a coupling cardinality constraint.
Comput. Oper. Res., 2021

Exact Augmented Lagrangian Duality for Mixed Integer Quadratic Programming.
SIAM J. Optim., 2020

A linear programming based approach to the Steiner tree problem with a fixed number of terminals.
Networks, 2020

Bicriteria Approximation of Chance-Constrained Covering Problems.
Oper. Res., 2020

The Benders Dual Decomposition Method.
Oper. Res., 2020

Optimization-Driven Scenario Grouping.
INFORMS J. Comput., 2020

Data-driven maintenance and operations scheduling in power systems under decision-dependent uncertainty.
IISE Trans., 2020

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint.
Discret. Optim., 2020

A Simulated Annealing Algorithm for the Directed Steiner Tree Problem.
CoRR, 2020

Stochastic dual dynamic integer programming.
Math. Program., 2019

Robust strategic bidding in auction-based markets.
Eur. J. Oper. Res., 2019

Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing.
Comput. Oper. Res., 2019

On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems.
SIAM J. Optim., 2018

On quantile cuts and their closure for chance constrained optimization problems.
Math. Program., 2018

A polyhedral approach to online bipartite matching.
Math. Program., 2018

Relaxations and approximations of chance constraints under finite distributions.
Math. Program., 2018

Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning.
INFORMS J. Comput., 2018

Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs.
INFORMS J. Comput., 2018

Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation.
Int. J. Prod. Res., 2018

Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs.
Comput. Optim. Appl., 2018

Distributionally robust simple integer recourse.
Comput. Manag. Sci., 2018

Maximizing a class of submodular utility functions with constraints.
Math. Program., 2017

Exact augmented Lagrangian duality for mixed integer linear programming.
Math. Program., 2017

Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs.
Math. Program., 2017

Relaxations and discretizations for the pooling problem.
J. Glob. Optim., 2017

A hybrid primal heuristic for finding feasible solutions to mixed integer programs.
Eur. J. Oper. Res., 2017

Polyhedral results for a class of cardinality constrained submodular minimization problems.
Discret. Optim., 2017

A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem.
Comput. Oper. Res., 2017

Learning to Run Heuristics in Tree Search.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid.
SIAM J. Optim., 2016

Maximizing expected utility over a knapsack constraint.
Oper. Res. Lett., 2016

Improving the Integer L-Shaped Method.
INFORMS J. Comput., 2016

Risk neutral and risk averse approaches to multistage renewable investment planning under uncertainty.
Eur. J. Oper. Res., 2016

Strengthened bounds for the probability of k-out-of-n events.
Discret. Appl. Math., 2016

Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

On the Quantile Cut Closure of Chance-Constrained Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

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

Minimum concave cost flow over a grid network.
Math. Program., 2015

Forbidden Vertices.
Math. Oper. Res., 2015

The Robust Redundancy Allocation Problem in Series-Parallel Systems With Budgeted Uncertainty.
IEEE Trans. Reliab., 2014

A cutting and scheduling problem in float glass manufacturing.
J. Sched., 2014

Using diversification, communication and parallelism to solve mixed-integer linear programs.
Oper. Res. Lett., 2014

Convex relaxations of chance constrained optimization problems.
Optim. Lett., 2014

Semi-continuous network flow problems.
Math. Program., 2014

Covering Linear Programming with Violations.
INFORMS J. Comput., 2014

Congestion-aware dynamic routing in automated material handling systems.
Comput. Ind. Eng., 2014

Solving Mixed Integer Bilinear Problems Using MILP Formulations.
SIAM J. Optim., 2013

A scenario decomposition algorithm for 0-1 stochastic programs.
Oper. Res. Lett., 2013

Totally unimodular stochastic programs.
Math. Program., 2013

Probabilistic Set Covering with Correlations.
Oper. Res., 2013

Mixed integer linear programming formulations for probabilistic constraints.
Oper. Res. Lett., 2012

Sell or Hold: A simple two-stage stochastic combinatorial optimization problem.
Oper. Res. Lett., 2012

A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs.
SIAM J. Optim., 2011

Maximizing a class of submodular utility functions.
Math. Program., 2011

An integer programming approach for linear programs with probabilistic constraints.
Math. Program., 2010

Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths.
Manag. Sci., 2010

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions.
Oper. Res., 2010

A Note on "A Superior Representation Method for Piecewise Linear Functions".
INFORMS J. Comput., 2010

An Automated Intensity-Modulated Radiation Therapy Planning System.
INFORMS J. Comput., 2010

A stochastic programming approach for planning horizons of infinite horizon capacity planning problems.
Eur. J. Oper. Res., 2010

Chemical Process Planning.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Approximating the stability region for binary mixed-integer programs.
Oper. Res. Lett., 2009

Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications.
J. Optimization Theory and Applications, 2009

The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty.
Oper. Res., 2009

Cutting Planes for Multistage Stochastic Integer Programs.
Oper. Res., 2009

Supply chain design under uncertainty using sample average approximation and dual decomposition.
Eur. J. Oper. Res., 2009

Cutting plane algorithms for solving a stochastic edge-partition problem.
Discret. Optim., 2009

A Sample Approximation Approach for Optimization with Probabilistic Constraints.
SIAM J. Optim., 2008

Sample average approximation of expected value constrained stochastic programs.
Oper. Res. Lett., 2008

A note on natural risk statistics.
Oper. Res. Lett., 2008

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs.
INFORMS J. Comput., 2008

On a Multi-stage Stochastic Programming Model for Inventory Planning.
INFOR Inf. Syst. Oper. Res., 2008

Selection, acquisition, and allocation of manufacturing technology in a multi-period environment.
Eur. J. Oper. Res., 2008

Coherent risk measures in inventory problems.
Eur. J. Oper. Res., 2007

Sequential pairing of mixed integer inequalities.
Discret. Optim., 2007

On formulations of the stochastic uncapacitated lot-sizing problem.
Oper. Res. Lett., 2006

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem.
Math. Program., 2006

A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs.
Math. Program., 2006

Convexity and decomposition of mean-risk stochastic programs.
Math. Program., 2006

Global Optimization of Probabilistically Constrained Linear Programs.
Proceedings of the Principles and Practice of Constraint Programming, 2006

The inverse optimal value problem.
Math. Program., 2005

A stochastic programming approach for supply chain network design under uncertainty.
Eur. J. Oper. Res., 2005

On a Class of Minimax Stochastic Programs.
SIAM J. Optim., 2004

On robust optimization of two-stage systems.
Math. Program., 2004

A finite branch-and-bound algorithm for two-stage stochastic integer programs.
Math. Program., 2004

On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies.
INFORMS J. Comput., 2004

A Multi-Stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty.
J. Glob. Optim., 2003

An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion.
Oper. Res., 2003

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study.
Comput. Optim. Appl., 2003

Dynamic Capacity Acquisition and Assignment under Uncertainty.
Ann. Oper. Res., 2003

Global Optimization of 0-1 Hyperbolic Programs.
J. Glob. Optim., 2002