Sinha Amitabh

Amitabh Sinha

Information about the author Amitabh Sinha will soon be added to the site.
Found 9 papers in total
Capacity Investment with Demand Learning
Capacity Investment with Demand Learning
2017
We study a firm’s optimal strategy to adjust its capacity using demand...
An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment
An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment
2015
We consider an online multi‐item retailer with multiple fulfillment facilities...
Investing in a Shared Supplier in a Competitive Market: Stochastic Capacity Case
Investing in a Shared Supplier in a Competitive Market: Stochastic Capacity Case
2015
When firms invest in a shared supplier, one key concern is whether the invested...
Efficient structures for innovative social networks
Efficient structures for innovative social networks
2010
What lines of communication among members of an organization are most productive in...
LP Rounding Approximation Algorithms for Stochastic Network Design
LP Rounding Approximation Algorithms for Stochastic Network Design
2007
We study the Steiner tree problem and the single–cable single–sink network...
Approximation algorithms for problems combining facility location and network design
Approximation algorithms for problems combining facility location and network design
2006
We present approximation algorithms for integrated logistics problems that combine...
Improved approximations for tour and tree covers
Improved approximations for tour and tree covers
2003
A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree...
Min–max tree covers of graphs
Min–max tree covers of graphs
2004
We provide constant factor approximation algorithms for covering the nodes of a graph...
An approximation algorithm for the edge-dilation k-center problem
An approximation algorithm for the edge-dilation k-center problem
2004
We provide an approximation algorithm for selecting centers in a complete graph so as...
Papers per page: