Amitabh Sinha
Amitabh Sinha
Verified email at
Cited by
Cited by
Hedging uncertainty: Approximation algorithms for stochastic optimization problems
R Ravi, A Sinha
Mathematical Programming 108, 97-114, 2006
Boosted sampling: approximation algorithms for stochastic optimization
A Gupta, M Pál, R Ravi, A Sinha
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
Joint dynamic pricing and order fulfillment for e-commerce retailers
Y Lei, S Jasin, A Sinha
Manufacturing & service operations management 20 (2), 269-284, 2018
An LP-based correlated rounding scheme for multi-item ecommerce order fulfillment
S Jasin, A Sinha
Operations Research 63 (6), 1336-1351, 2015
Min–max tree covers of graphs
G Even, N Garg, J Könemann, R Ravi, A Sinha
Operations Research Letters 32 (4), 309-315, 2004
Integrated optimization of procurement, processing, and trade of commodities
SK Devalkar, R Anupindi, A Sinha
Operations Research 59 (6), 1369-1381, 2011
Joint inventory and fulfillment decisions for omnichannel retail networks
A Govindarajan, A Sinha, J Uichanco
Naval Research Logistics (NRL) 68 (6), 779-794, 2021
Investing in a shared supplier in a competitive market: Stochastic capacity case
A Qi, HS Ahn, A Sinha
Production and Operations Management 24 (10), 1537-1551, 2015
On the approximability of some network design problems
J Chuzhoy, A Gupta, J Naor, A Sinha
ACM Transactions on Algorithms (TALG) 4 (2), 1-17, 2008
Approximation algorithms for problems combining facility location and network design
R Ravi, A Sinha
Operations Research 54 (1), 73-81, 2006
Efficient structures for innovative social networks
WS Lovejoy, A Sinha
Management science 56 (7), 1127-1145, 2010
Solving truckload procurement auctions over an exponential number of bundles
RLY Chen, S AhmadBeygi, A Cohn, DR Beil, A Sinha
Transportation Science 43 (4), 493-510, 2009
An edge in time saves nine: LP rounding approximation algorithms for stochastic network design
A Gupta, R Ravi, A Sinha
45th Annual IEEE Symposium on Foundations of Computer Science, 218-227, 2004
What about Wednesday? Approximation algorithms for multistage stochastic optimization
A Gupta, M Pál, R Ravi, A Sinha
International Workshop on Approximation Algorithms for Combinatorial …, 2005
On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem
N Garg, R Khandekar, G Konjevod, R Ravi, FS Salman, A Sinha
Integer Programming and Combinatorial Optimization: 8th International IPCO …, 2001
Near-optimal bisection search for nonparametric dynamic pricing with inventory constraint
YM Lei, S Jasin, A Sinha
Ross School of Business Paper, 2014
Multicommodity facility location
R Ravi, A Sinha
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004
Non-clairvoyant scheduling for minimizing mean slowdown
N Bansal, K Dhamdhere, J Könemann, A Sinha
Algorithmica 40, 305-318, 2004
Approximating the degree-bounded minimum diameter spanning tree problem
J Könemann, A Levin, A Sinha
Algorithmica 41, 117-129, 2005
LP rounding approximation algorithms for stochastic network design
A Gupta, R Ravi, A Sinha
Mathematics of Operations Research 32 (2), 345-364, 2007
The system can't perform the operation now. Try again later.
Articles 1–20