Selected Publications
Minsum Location of a Traveling Salesman. Networks. 16
.
1986. Heuristics and Bounds for the Traveling Salesman Location Problem on the Plane. Operations Research Letters. 6
.
1987. Finding the Optimal A Priori Tour and Location ofa Traveling salesman with Non Homogeneous Customers. Transportation Science. 22
.
1988. A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks. Operations Research. 36
.
1988. The Minimax Multistop Location Problem on a Tree. Networks. 18
.
1988. Minisum Location of a Traveling Salesman on Simple Networks. European Journal of Operations Research. 36
.
1988. The Traveling Salesman Location Problem on Stochastic Networks. Transportation Science. 23
.
1989. The Complexity of Finding Two Disjoint Paths with Min Max Objective Function. Discrete Applied Mathematics. 26
.
1990. Conditional Location Problems on Networks. Transportation Science. 24
.
1990. .
1990. A Queueing-Location Problem on the Plane. Naval Research Logistics. 37
.
1990. Scheduling Tasks with Failure Probabilities to Minimize Expected Cost. Naval Research Logistics. 37
.
1990. Worst-Case Analysis of Heuristics for the Multi-Depot Capacitated Vehicle Routing Problems. ORSA Journal on Computing. 2
.
1990. The Capacitated Traveling Salesman Location Problem. Transportation Science. 25
.
1991. Controllable Production Rates in a Family Production Context. International Journal of Producdtion Research. 29
.
1991. Minimizing the Total Flow Time of $n$ Jobs on a Network. IIE Transactions. 23
.
1991. Analysis of Heuristics for the Design of Tree Networks. Annals of Operations Research. 36
.
1992. Asymptotic Behavior of the Weber Location Problem on the Plane. Annals of Operations Research. 40
.
1992. The Complexity of the Staggering Problem and Other Classical Inventory Problems. Operations Research Letters. 12
.
1992. On the Distance Constrained Vehicle Routing Problem. Operations Research. 40
.
1992. .
1992. Hierarchical Design for Probabilistic Distribution Systems in Euclidean Spaces. Management Science. 38
.
1992. Light Traffic Heuristic for an M/G/1 Queue with Limited Inventory. Annals of Operations Research. 40
.
1992. On the Minimum-Cost-Bounded Diameter and the Fixed-Budget-Minimum-Diameter Edge Addition Problems. Operations Research Letters. 11
.
1992. The Point-to-Point Delivery and Connection Problems: Complexity and Algorithms. Discrete Applied Mathematics. 36
.
1992. Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands. Operations Research. 40
.
1992. A Note on the Prize Collecting Traveling Salesman Problem. Mathematical Programming. 59
.
1993. Probabilistic Analysis of Heuristics for the Vehicle Routing with Time Windows. American Journal of Mathematical and Management Sciences. 13
.
1993. A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands. Mathematics of Operations Research. 18
.
1993. New Worst Case Results for the Bin-Packing Problem. Naval Research Logistics. 41
.
1994. Probabilistic a Priori Routing Location Problems. Naval Research Logistics. 41
.
1994. Rejoinder to "A Note on Bounds for Direct Shipping". Management Science. 40
.
1994. Worst-Case Analysis of Heuristics for the Bin-Packing Problem with General Cost Structure. Operations Research. 42
.
1994. Analytical Analysis of Vehicle Routing and Inventory Routing Problems. Handbooks in Operations Research and Management Science, the volume on NetworkRouting. M. Ball, T. Magnanti, C. Monma and G. Nemhauser, eds., North-Holland, Amsterdam.
.
1995. A Location Based Heuristic for General Routing Problems. Operations Research. 43
.
1995. Location-Routing Problems with Uncertainty. Facilities Location, Z. Drezner, ed., Springer Verlag.
.
1995. Routing in Linear Lightwave Networks. IEEE/ACM Transactions on Networking. 3
.
1995. The New Generation of Vehicle Routing Research: Robust Algorithms Addressing Uncertainty. Operations Research. 44
.
1996. Probabilistic Analysis and Practical Algorithms for the Vehicle Routing Problem with Time Windows. Operations Research. 44
.
1996. Single Resource Multi-Item Inventory Systems. Operations Research. 44
.
1996. Average Case Analysis of the Bin-Packing Problem with General Cost Structure. Naval Research Logistics. 44
.
1997. A Computerized Approach to the New York City School Bus Routing Problem. IIE Transactions. 29
.
1997. On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem. Operations Research. 45
.
1997. The Bullwhip Effect: Managerial Insights on the Impact of Forecasting and Information on Variability in a Supply Chain. Quantitative Models for Supply Chain Management, S. Tayur, R. Ganeshan and M. Magazine, eds., Kluwer.
.
1998. A New Computerized Beer Game: Teaching the Value of Integrated Supply Chain Management. Supply Chain and Technology Management. Hau Lee and Shu Ming Ng, eds., POMS Series in Technology and Operations Management. 1
.
1998. Parallel Machine Scheduling, Linear Programming and List Scheduling Heuristics. Operations Research. 46
.
1998. Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem. Operations Research. 46
.
1998. Probabilistic Analysis and Practical Algorithms for Three-Level Distribution Systems. Management Science. 44
.
1998. Worst-case Analyses, Linear Programming and the Bin-packing Problem. Mathematical Programming. 83
.
1998. Communication Networks. CRC Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen et al. (eds.), CRC Press, Boca Raton, FL.
.
1999. Packing and Covering. CRC Handbook of Discrete and Combinatorial Mathematics, K. H. Rosen et al. (eds.), CRC Press, Boca Raton, FL.
.
1999. The Impact of Exponential Smoothing Forecasts on the Bullwhip Effect. Naval Research Logistics. 47
.
2000. Minimax Analysis for the Discrete Finite Horizon Inventory Model. IIE Transactions. October 2000
.
2000. .
2000. Asymptotic Analysis of an On-Line Algorithm for the Single Machine Completion Time Problem With Release Dates. Operations Research Letters. 29
.
2001. The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem. Operations Research. 49
.
2001. The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. Proceeding of the 8th International IPCO Conference, Utrecht, The Netherlands. June 2001
.
2001. Locating Containers in a Mega Terminal. Naval Research Logistics. 48
.
2001. Logistics Systems Modeling. Handbook of Industrial Engineering, 3rd edition, edited by G. Salvendy and published by John Wiley & Sons.
.
2001. Effective Zero Inventory Ordering Policies for the Single-Warehouse Multi-Retailer Problem with Piecewise Linear Cost Structures. Management Science. 48
.
2002. On the Effectiveness of the Zero-Inventory-Ordering Policy for the Economic Lot Sizing Model with Piecewise Linear Cost Structures. Operations Research. 50
.
2002. Set-Covering Based Algorithms for the Capacitated VRP. The Vehicle Routing Problem, P. Toth and D. Vigo, eds., SIAM Monographs on Discrete Mathematics and Applications.
.
2002. Supply Chain Responsiveness in the Wake of a Major Crisis. Supply Chain Management Review.
.
2002. Uniform distribution of inventory positions in two-echelon periodic review systems with batch-ordering policies and interdependent demands. European Journal of Operations Research. 140
.
2002. On Assemble-To-Order Systems with Flexible Customers. IIE Transactions. 35
.
2003. Communications Network Design Models. Handbook of Graph Theory. J. L. Gross and J. Yellen eds., CRC Press.
.
2003. Finding the Right Balance. CLO: Chief Logistics Officer. December 2003
.
2003. Production and Distribution Lot Sizing in a Two Stage Supply Chain. IIE Transactions. 35
.
2003. Supply Chain Design and Planning - Applications of Optimization Techniques for Strategic and Tactical Models. Handbooks in Operations Research and Management Science, the volume on Supply Chain Management. S. Graves and A. G. Kok, eds., North-Holland, Amsterdam.
.
2003. Tactical Planning for Reinventing the Supply CHain. The Practice of Supply Chain Management, edited by T Harrison, H. Lee and J. Neale; Kluwer.
.
2003. The Value of Information Sharing in a Two-stage Supply Chain with Production Capacity Constraints. Naval Research Logistics. 50
.
2003. Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Infinite Horizon Case. Mathematics of Operations Research. 29
.
2004. Coordination of Pricing and Inventory Decisions: A Survey and Classification. Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era, D. Simchi-Levi, S. D. Wu and Z. J. Shen, eds. Kluwers.
.
2004. A General Decomposition Algorithm for Parallel Queues with Correlated Arrivals. Queueing Systems. 47
.
2004. Inventory Optimization: The Last Frontier. Inbound Logistics. March 2004
.
2004. Two-Echelon Spare Parts Inventory System Subject to a Service Constraint. IIE Transactions. 36
.
2004. The Value of Information Sharing in a Two-stage Supply Chain with Production Capacity Constraints: The Infinite Horizon Case. Probabililty in the Engineering and Informational Science. 18
.
2004. On the Asymptotic Optimality of Algorithms for the Flow Shop Problem with Release Dates. Naval Research Logistics. 52
.
2005. Do IT Investments Really Change Financial Performance? Supply Chain Management Review. May
.
2005. Dynamic Pricing and the Direct-to-Consumer Model in the Automotive Industry. Elecontronic Commerce Journal. 5
.
2005. The Impact of RFID on Supply Chain Efficiency. RFID and Beyond: Growing Your Business Through Real World Awareness. C. Heinrich, Editor, Wiley.
.
2005. Innovative Supply Contracts. The Missing Link: Designing Supply Chains for Growth, Profitability and Resilience, Edited by J. Rothfeder.
.
2005. A Portfolio Approach for Procurement Contracts. Production and Operations Management. 14
.
2005. Safety Stock Positioning in Supply Chains with Stochastic Lead Times. Manufacturing and Service Operations Management. 7
.
2005. On the Asymptotic Optimality of a Simple On-line Algorithm for the Stochastic Single Machine Weighted Completion Time Problem and its Extensions. Operations Research. 54
.
2006. The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates. Mathematical Programming. 106
.
2006. Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Continuous Review Model. Operations Research Letters. 36
.
2006. Dynamic Pricing Strategies for Manufacturing with Stochastic Demand and Discretionary Sales. Manufacturing and Service Operations Management. 8
.
2006. Inventory Placement in Acyclic Supply Chain Networks. Operations Research Letters. 36
.
2006. Mean-Variance Trade-offs in Supply Contracts. Naval Research Logistics. 53
.
2006. .
2006. Dispatching Vehicles in a Mega Container Terminal. Container Terminals and Cargo Systems, K. H. Kim and H. O. Gunther, eds., Springer.
.
2007. The Impact of Manufacturer Rebates on Supply Chain Profits. Naval Research Logistics. 54
.
2007. Optimal Production and Inventory Policies of Priority, Time and Price Differentiated Customers. IIE Transactions. 39
.
2007. A Produce-to- Stock System with Advance Demand Information and Secondary Customers. Naval Research Logistics. 54
.
2007. Risk Aversion in Inventory Management. Operations Research. 55
.
2007. Supply Chain Coordination and Influenza Vaccination. Operations Research. 56
.
2007. Tactical Inventory Policies for Service-Differentiated Customers. Operations Research Letters. 36
.
2007. Competition in the Supply Option Market. Operations Research. 57
.
2008. Crude Calculations; Why high oil prices are upending the way companies should manage their supply chains. The Wall Street Journal. (September 22, 2008)
.
2008.