Milind Dawande

Orcid: 0000-0001-6956-0856

Affiliations:
  • University of Texas at Dallas, USA


According to our database1, Milind Dawande authored at least 82 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Dynamic Pricing and Capacity Optimization in Railways.
Manuf. Serv. Oper. Manag., January, 2024

2023
Three Years, Two Papers, One Course Off: Optimal Nonmonetary Reward Policies.
Manag. Sci., May, 2023

An Asymptotically Tight Learning Algorithm for Mobile-Promotion Platforms.
Manag. Sci., March, 2023

2022
Curbing Emissions: Environmental Regulations and Product Offerings Across Markets.
Manuf. Serv. Oper. Manag., 2022

Technical Note - A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services.
Oper. Res., 2022

Multiproduct Pricing with Discrete Price Sets.
Oper. Res., 2022

Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees.
Oper. Res., 2022

2021
Better to Bend than to Break: Sharing Supply Risk Using the Supply-Flexibility Contract.
Manuf. Serv. Oper. Manag., 2021

On the Structure of Bottlenecks in Processes.
Manag. Sci., 2021

The SafeBirth Clinic.
INFORMS Trans. Educ., 2021

How to Sell a Data Set? Pricing Policies for Data Monetization.
Inf. Syst. Res., 2021

Procurement with Cost and Noncost Attributes: Cost-Sharing Mechanisms.
Oper. Res., 2021

Industrial symbiosis: Impact of competition on firms' willingness to implement.
IISE Trans., 2021

2020
Supplier Centrality and Auditing Priority in Socially Responsible Supply Chains.
Manuf. Serv. Oper. Manag., 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
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
The Making of a Good Impression: Information Hiding in Ad Exchanges.
MIS Q., 2016

Milking the Quality Test: Improving the Milk Supply Chain Under Competing Collection Intermediaries.
Manag. Sci., 2016

Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics.
Ann. Oper. Res., 2016

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

2014
Optimal Selection of Line Extensions: Incorporating Operational, Financial, and Marketing Constraints.
IEEE Trans. Engineering Management, 2014

Optimal Software Reuse in Incremental Software Development: A Transfer Pricing Approach.
Manag. Sci., 2014

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

Role Refinement in Access Control: Model and Analysis.
INFORMS J. Comput., 2014

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

2013
Efficient Distribution of Water Between Head-Reach and Tail-End Farms in Developing Countries.
Manuf. Serv. Oper. Manag., 2013

2012
Structural Search and Optimization in Social Networks.
INFORMS J. Comput., 2012

2011
Guest Editorial Equipment and Operations Automation in the Semiconductor Industry.
IEEE Trans Autom. Sci. Eng., 2011

Productivity Improvement From Using Machine Buffers in Dual-Gripper Cluster Tools.
IEEE Trans Autom. Sci. Eng., 2011

Value of Local Cash Reuse: Inventory Models for Medium-Size Depository Institutions Under the New Federal Reserve Policy.
Manuf. Serv. Oper. Manag., 2011

Quantifying the Impact of Layout on Productivity: An Analysis from Robotic-Cell Manufacturing.
Oper. Res., 2011

OR Practice - Production Planning with Patterns: A Problem from Processed Food Manufacturing.
Oper. Res., 2011

A Short-Range Scheduling Model for Blockbuster's Order-Processing Operation.
Interfaces, 2011

On a labeling problem in graphs.
Discret. Appl. Math., 2011

2010
On the Interaction Between Demand Substitution and Production Changeovers.
Manuf. Serv. Oper. Manag., 2010

An Analysis of Coordination Mechanisms for the U.S. Cash Supply Chain.
Manag. Sci., 2010

2009
Multiple Part-Type Production in Robotic Cells: Equivalence of Two Real-World Models.
Manuf. Serv. Oper. Manag., 2009

Structural analysis of a fractional matching problem.
Discret. Appl. Math., 2009

2008
Maximum Commonality Problems: Applications and Analysis.
Manag. Sci., 2008

Link scheduling in wireless sensor networks: Distributed edge-coloring revisited.
J. Parallel Distributed Comput., 2008

A Comparison of Pair Versus Solo Programming Under Different Objectives: An Analytical Approach.
Inf. Syst. Res., 2008

2007
Optimal Scheduling and Placement of Internet Banner Advertisements.
IEEE Trans. Knowl. Data Eng., 2007

An Integer-Programming Approach to the Bicriteria Multicasting Problem in Optical Networks.
IEEE Trans. Commun., 2007

Managing a Bank's Currency Inventory Under New Federal Reserve Guidelines.
Manuf. Serv. Oper. Manag., 2007

Forecast Horizons for a Class of Dynamic Lot-Size Problems Under Discrete Future Demand.
Oper. Res., 2007

A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks.
INFORMS J. Comput., 2007

2006
Scheduling a two-stage flowshop under makespan constraint.
Math. Comput. Model., 2006

Computing Minimal Forecast Horizons: An Integer Programming Approach.
J. Math. Model. Algorithms, 2006

Effective Heuristics for Multiproduct Partial Shipment Models.
Oper. Res., 2006

2005
Dominance of Cyclic Solutions and Challenges in the Scheduling of Robotic Cells.
SIAM Rev., 2005

Scheduling Web Advertisements: A Note on the Minspace Problem.
J. Sched., 2005

Sequencing and Scheduling in Robotic Cells: Recent Developments.
J. Sched., 2005

Approximation algorithms for k.
Eur. J. Oper. Res., 2005

Link scheduling in sensor networks: distributed edge coloring revisited.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

Hop-constrained energy-aware routing in wireless sensor networks.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

2004
Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells.
J. Sched., 2004

The Slab-Design Problem in the Steel Industry.
Interfaces, 2004

An integral flow-based energy-efficient routing algorithm for wireless sensor networks.
Proceedings of the 2004 IEEE Wireless Communications and Networking Conference , 2004

2003
Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page.
J. Sched., 2003

A notion of cross-perfect bipartite graphs.
Inf. Process. Lett., 2003

Highly efficient spare capacity planning for generalized link restoration.
Proceedings of the 12th International Conference on Computer Communications and Networks, 2003

Energy efficient schemes for wireless sensor networks with multiple mobile base stations.
Proceedings of the Global Telecommunications Conference, 2003

2002
On Throughput Maximization in Constant Travel-Time Robotic Cells.
Manuf. Serv. Oper. Manag., 2002

2001
On Bipartite and Multipartite Clique Problems.
J. Algorithms, 2001

Octane: A New Heuristic for Pure 0-1 Programs.
Oper. Res., 2001

Variable Sized Bin Packing With Color Constraints.
Electron. Notes Discret. Math., 2001

Scheduling Advertisements on a Web Page: New and Improved Approximation Algorithms.
Electron. Notes Discret. Math., 2001

2000
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
J. Comb. Optim., 2000

The Surplus Inventory Matching Problem in the Process Industry.
Oper. Res., 2000

Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming.
Oper. Res., 2000

1999
Optimal Reliability Allocation with Discrete Cost-Reliability Data for Components.
Oper. Res., 1999

A Class of Hard Small 0-1 Programs.
INFORMS J. Comput., 1999

1995
Combining and Strengthening Gomory Cuts.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994
Algorithm 737; INTLIB: a portable Fortran 77 interval standard-function library.
ACM Trans. Math. Softw., 1994


  Loading...