Ganesh Janakiraman

According to our database1, Ganesh Janakiraman authored at least 38 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad Exchanges.
Inf. Syst. Res., 2020

Ad-Blockers: A Blessing or a Curse?
Inf. Syst. Res., 2020

2019
Determining Process Capacity: Intractability and Efficient Special Cases.
Manuf. Serv. Oper. Manag., 2019

Data-Driven Decisions for Problems with an Unspecified Objective Function.
INFORMS J. Comput., 2019

How to Sell a Dataset?: Pricing Policies for Data Monetization.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Simple Policies for Managing Flexible Capacity.
Manuf. Serv. Oper. Manag., 2018

Optimal Procurement Auctions Under Multistage Supplier Qualification.
Manuf. Serv. Oper. Manag., 2018

Procurement Policies for Mobile-Promotion Platforms.
Manag. Sci., 2018

Technical Note - Analysis of Scrip Systems: On an Open Question in Johnson et al. (2014).
Oper. Res., 2018

2017
Not Just a Fad: Optimal Sequencing in Mobile In-App Advertising.
Inf. Syst. Res., 2017

On Integral Policies in Deterministic and Stochastic Distribution Systems.
Oper. Res., 2017

2016
Capacitated Multiechelon Inventory Systems: Policies and Bounds.
Manuf. Serv. Oper. Manag., 2016

The Making of a Good Impression: Information Hiding in Ad Exchanges.
MIS Q., 2016

2015
Analysis of Tailored Base-Surge Policies in Dual Sourcing Inventory Systems.
Manag. Sci., 2015

Optimal Bidding for Mobile-Ad Campaigns.
Proceedings of the International Conference on Information Systems, 2015

2014
Fixed-Dimensional Stochastic Dynamic Programs: An Approximation Scheme and an Inventory Application.
Oper. Res., 2014

Robustness of Order-Up-to Policies in Lost-Sales Inventory Systems.
Oper. Res., 2014

Making a Good Impression: Information Revelation Policies in Ad Exchanges.
Proceedings of the International Conference on Information Systems, 2014

2013
New results on the newsvendor model and the multi-period inventory model with backordering.
Oper. Res. Lett., 2013

2012
Technical Note - On Optimal Policies for Inventory Systems with Batch Ordering.
Oper. Res., 2012

2011
Average Cost Single-Stage Inventory Models: An Analysis Using a Vanishing Discount Approach.
Oper. Res., 2011

TECHNICAL NOTE - Inventory Systems with a Generalized Cost Model.
Oper. Res., 2011

Parametric concavity in stochastic dynamic programs.
Comput. Ind. Eng., 2011

2010
New Policies for the Stochastic Inventory Control Problem with Two Supply Sources.
Oper. Res., 2010

Technical Note - Capacitated Serial Inventory Systems: Sample Path and Stability Properties Under Base-Stock Policies.
Oper. Res., 2010

On the Optimal Policy Structure in Serial Inventory Systems with Lost Sales.
Oper. Res., 2010

2009
An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand.
Math. Oper. Res., 2009

Asymptotic Optimality of Order-Up-To Policies in Lost Sales Inventory Systems.
Manag. Sci., 2009

A Decomposition Approach for a Class of Capacitated Serial Systems.
Oper. Res., 2009

2008
A sample-path approach to the optimality of echelon order-up-to policies in serial inventory systems.
Oper. Res. Lett., 2008

A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales.
Math. Oper. Res., 2008

Inventory Management with Auctions and Other Sales Channels: Optimality of (<i>s, S</i>) Policies.
Manag. Sci., 2008

(<i>s, S</i>) Optimality in Joint Inventory-Pricing Control: An Alternate Approach.
Oper. Res., 2008

2007
A Comparison of the Optimal Costs of Two Canonical Inventory Systems.
Oper. Res., 2007

2005
Efficient Auction Mechanisms for Supply Chain Procurement.
Manag. Sci., 2005

2004
Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies.
Oper. Res., 2004

Inventory Control in Directed Networks: A Note on Linear Costs.
Oper. Res., 2004

2003
Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: the bottleneck lower bound.
Oper. Res. Lett., 2003


  Loading...