Shabbir Ahmed
Orcid: 0000-0001-7049-7305Affiliations:
- 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 99 papers
between 2002 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on publons.com
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2022
Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making.
Math. Program., 2022
Optimized Bonferroni approximations of distributionally robust joint chance constraints.
Math. Program., 2022
Math. Program., 2022
INFORMS J. Comput., 2022
2021
INFORMS J. Comput., 2021
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
2020
SIAM J. Optim., 2020
A linear programming based approach to the Steiner tree problem with a fixed number of terminals.
Networks, 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
2019
Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing.
Comput. Oper. Res., 2019
2018
On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems.
SIAM J. Optim., 2018
Math. Program., 2018
Math. Program., 2018
Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning.
INFORMS J. Comput., 2018
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
2017
Math. Program., 2017
Math. Program., 2017
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs.
Math. Program., 2017
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
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
2016
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid.
SIAM J. Optim., 2016
Risk neutral and risk averse approaches to multistage renewable investment planning under uncertainty.
Eur. J. Oper. Res., 2016
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
Proceedings of the Integer Programming and Combinatorial Optimization, 2016
2015
Corrigendum to "A scenario decomposition algorithm for 0-1 stochastic programs" [Oper. Res. Lett. 41(6) (2013) 565-569].
Oper. Res. Lett., 2015
2014
The Robust Redundancy Allocation Problem in Series-Parallel Systems With Budgeted Uncertainty.
IEEE Trans. Reliab., 2014
Using diversification, communication and parallelism to solve mixed-integer linear programs.
Oper. Res. Lett., 2014
Comput. Ind. Eng., 2014
2013
SIAM J. Optim., 2013
Oper. Res. Lett., 2013
2012
Oper. Res. Lett., 2012
Oper. Res. Lett., 2012
2011
A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs.
SIAM J. Optim., 2011
2010
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
INFORMS J. Comput., 2010
INFORMS J. Comput., 2010
A stochastic programming approach for planning horizons of infinite horizon capacity planning problems.
Eur. J. Oper. Res., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
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
Supply chain design under uncertainty using sample average approximation and dual decomposition.
Eur. J. Oper. Res., 2009
Discret. Optim., 2009
2008
SIAM J. Optim., 2008
Oper. Res. Lett., 2008
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs.
INFORMS J. Comput., 2008
INFOR Inf. Syst. Oper. Res., 2008
Selection, acquisition, and allocation of manufacturing technology in a multi-period environment.
Eur. J. Oper. Res., 2008
2007
2006
Oper. Res. Lett., 2006
Math. Program., 2006
A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs.
Math. Program., 2006
Proceedings of the Principles and Practice of Constraint Programming, 2006
2005
Eur. J. Oper. Res., 2005
2004
Math. Program., 2004
On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies.
INFORMS J. Comput., 2004
2003
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
2002