Kumar Subodha

Subodha Kumar

Information about the author Subodha Kumar will soon be added to the site.
Found 17 papers in total
When Being Hot Is Not Cool: Monitoring Hot Lists for Information Security
When Being Hot Is Not Cool: Monitoring Hot Lists for Information Security
2016
We study operational and managerial problems arising in the context of security...
Optimizing Performance-Based Internet Advertisement Campaigns
Optimizing Performance-Based Internet Advertisement Campaigns
2017
This study provides an approach to manage an ongoing Internet ad campaign that...
Managing Co-Creation in Information Technology Projects: A Differential Games Approach
Managing Co-Creation in Information Technology Projects: A Differential Games Approach
2016
We study the relationship between a client and a vendor in value co‐creation...
An Integrated Logistic Model for Predictable Disasters
An Integrated Logistic Model for Predictable Disasters
2016
In the aftermath of a disaster, the relief items are transported from temporary...
Optimization of Recommender Systems Based on Inventory
Optimization of Recommender Systems Based on Inventory
2016
We consider subscription‐based rental organizations, such as Netflix, where the...
Managing Logistics in Regional Banknote Supply Chain Under Security Concerns
Managing Logistics in Regional Banknote Supply Chain Under Security Concerns
2015
We study the logistics problem faced by Regional Branches (RBs) of a central bank in...
Advertising Strategies in Electronic Retailing: A Differential Games Approach
Advertising Strategies in Electronic Retailing: A Differential Games Approach
2012
We consider advertising problems under an information technology (IT) capacity...
Optimal Enhancement and Lifetime of Software Systems: A Control Theoretic Analysis
Optimal Enhancement and Lifetime of Software Systems: A Control Theoretic Analysis
2011
We develop an optimal control model to maximize the net value provided by a software...
Dual Objective Segmentation to Improve Targetability: An Evolutionary Algorithm Approach**
Dual Objective Segmentation to Improve Targetability: An Evolutionary Algorithm Approach**
2011
Cluster-based segmentation usually involves two sets of variables: (i) the needs-based...
Optimization models for assessing the peak capacity utilization of intelligent transportation systems
Optimization models for assessing the peak capacity utilization of intelligent transportation systems
2012
With limited economic and physical resources, it is not feasible to continually expand...
Reassessing Data Quality for Information Products
Reassessing Data Quality for Information Products
2010
The quality profile of information retrieved from a database using a query is quite...
A Comparison of Pair Versus Solo Programming Under Different Objectives: An Analytical Approach
A Comparison of Pair Versus Solo Programming Under Different Objectives: An Analytical Approach
2008
This study compares the performances of pair development (an approach in which a pair...
Scheduling advertisements on a Web page to maximize revenue
Scheduling advertisements on a Web page to maximize revenue
2006
Many Web sites (e.g. Hotmail, Yahoo) provide free services to the users while...
Scheduling web advertisements: a note on the minspace problem
Scheduling web advertisements: a note on the minspace problem
2005
Free services to internet users are commonly available on many web sites, e.g.,...
Performance bounds of algorithms for scheduling advertisements on a Web page
Performance bounds of algorithms for scheduling advertisements on a Web page
2003
Consider a set of n advertisements (hereafter called ‘ads’) A ={A 1...
Lot streaming and scheduling heuristics for m-machine no-wait flowshops
Lot streaming and scheduling heuristics for m-machine no-wait flowshops
2000
The objective of this paper is to minimize makespan in m -machine no-wait flowshops...
Lot streaming and scheduling heuristics for m-machine no-wait flowshops
Lot streaming and scheduling heuristics for m-machine no-wait flowshops
2000
The objective of this paper is to minimize makespan in m-machine no-wait flowshops...
Papers per page: